Anatoli B. Juditsky

Orcid: 0000-0001-5231-363X

According to our database1, Anatoli B. Juditsky authored at least 49 papers between 1993 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
On Design of Polyhedral Estimates in Linear Inverse Problems.
SIAM J. Math. Data Sci., March, 2024

2023
Unifying mirror descent and dual averaging.
Math. Program., May, 2023

Accelerated stochastic approximation with state-dependent noise.
CoRR, 2023

Generalized generalized linear models: Convex estimation and online bounds.
CoRR, 2023

2022
Tight computationally efficient approximation of matrix norms with applications.
Open J. Math. Optim., March, 2022

On well-structured convex-concave saddle point problems and variational inequalities with monotone operators.
Optim. Methods Softw., 2022

Stochastic Mirror Descent for Large-Scale Sparse Recovery.
CoRR, 2022

Recovery of Intrinsic Heterojunction Bipolar Transistors Profiles by Neural Networks.
Proceedings of the 2022 IEEE BiCMOS and Compound Semiconductor Integrated Circuits and Technology Symposium, 2022

2021
Constant Depth Decision Rules for multistage optimization under uncertainty.
Eur. J. Oper. Res., 2021

2020
Convex Parameter Recovery for Interacting Marked Processes.
IEEE J. Sel. Areas Inf. Theory, 2020

Sparse recovery by reduced variance stochastic approximation.
CoRR, 2020

Convex Recovery of Marked Spatio-Temporal Point Processes.
CoRR, 2020

2019
Algorithms of Robust Stochastic Optimization Based on Mirror Descent Method.
Autom. Remote. Control., 2019

Signal Recovery by Stochastic Optimization.
Autom. Remote. Control., 2019

2017
Non-asymptotic confidence bounds for the optimal value of a stochastic program.
Optim. Methods Softw., 2017

Decomposition Techniques for Bilinear Saddle Point Problems and Variational Inequalities with Affine Monotone Operators.
J. Optim. Theory Appl., 2017

2016
Solving variational inequalities with monotone operators on domains given by Linear Minimization Oracles.
Math. Program., 2016

Structure-Blind Signal Recovery.
Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

2015
Conditional gradient algorithms for norm-regularized smooth convex optimization.
Math. Program., 2015

Mirror Prox algorithm for multi-term composite minimization and semi-separable problems.
Comput. Optim. Appl., 2015

On sequential hypotheses testing via convex optimization.
Autom. Remote. Control., 2015

Adaptive Recovery of Signals by Convex Optimization.
Proceedings of The 28th Conference on Learning Theory, 2015

2014
Dual subgradient algorithms for large-scale nonsmooth learning problems.
Math. Program., 2014

2013
Randomized first order algorithms with applications to ℓ 1-minimization.
Math. Program., 2013

Sparse non Gaussian component analysis by semidefinite programming.
Mach. Learn., 2013

Mirror Prox Algorithm for Multi-Term Composite Minimization and Alternating Directions.
CoRR, 2013

2012
On unified view of nullspace-type conditions for recoveries associated with general sparsity structures
CoRR, 2012

Robust eigenvector of a stochastic matrix with application to PageRank.
Proceedings of the 51th IEEE Conference on Decision and Control, 2012

2011
Accuracy Guarantees for ℓ<sub>1</sub>-Recovery.
IEEE Trans. Inf. Theory, 2011

On Low Rank Matrix Approximations with Applications to Synthesis Problem in Compressed Sensing.
SIAM J. Matrix Anal. Appl., 2011

On verifiable sufficient conditions for sparse signal recovery via <i>ℓ</i><sub>1</sub> minimization.
Math. Program., 2011

Verifiable conditions of <i>ℓ</i><sub>1</sub>-recovery for sparse signals with sign restrictions.
Math. Program., 2011

2010
Sparse non-Gaussian component analysis.
IEEE Trans. Inf. Theory, 2010

2009
Robust Stochastic Approximation Approach to Stochastic Programming.
SIAM J. Optim., 2009

2008
A New Algorithm for Estimating the Effective Dimension-Reduction Subspace.
J. Mach. Learn. Res., 2008

2006
Remark on "Recursive Aggregation of Estimators by the Mirror Descent Algorithm with Averaging" published in <i>Probl. Peredachi Inf.</i>, 2005, no. 4.
Probl. Inf. Transm., 2006

2005
Recursive Aggregation of Estimators by the Mirror Descent Algorithm with Averaging.
Probl. Inf. Transm., 2005

Generalization Error Bounds for Aggregation by Mirror Descent with Averaging.
Proceedings of the Advances in Neural Information Processing Systems 18 [Neural Information Processing Systems, 2005

1999
Introduction to Special Issue on Mutliscale Statistical Signal Analysis and Its Application.
IEEE Trans. Inf. Theory, 1999

1998
An algorithm for tracking a random walk with unknown drift.
Proceedings of the 1998 IEEE International Conference on Acoustics, 1998

Wavelets in identification.
Proceedings of the Fuzzy logic and expert systems applications., 1998

1995
Accuracy analysis for wavelet approximations.
IEEE Trans. Neural Networks, 1995

Nonlinear black-box modeling in system identification: a unified overview.
Autom., 1995

Nonlinear black-box models in system identification: Mathematical foundations.
Autom., 1995

Determination of singular points in 2D deformable flow fields.
Proceedings of the Proceedings 1995 International Conference on Image Processing, 1995

1994
A robust algorithm for random parameter tracking.
IEEE Trans. Autom. Control., 1994

1993
A stochastic estimation algorithm with observation averaging.
IEEE Trans. Autom. Control., 1993

On the projection algorithm and delay of peaking in adaptive control.
IEEE Trans. Autom. Control., 1993

Accelerated Stochastic Approximation.
SIAM J. Optim., 1993


  Loading...