Arnak S. Dalalyan

According to our database1, Arnak S. Dalalyan authored at least 39 papers between 2007 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Parallelized Midpoint Randomization for Langevin Monte Carlo.
CoRR, 2024

2023
Guaranteed Optimal Generative Modeling with Maximum Deviation from the Empirical Distribution.
CoRR, 2023

Langevin Monte Carlo for strongly log-concave distributions: Randomized midpoint revisited.
CoRR, 2023

Graphon Estimation in bipartite graphs with observable edge labels and unobservable node labels.
CoRR, 2023

Matching Map Recovery with an Unknown Number of Outliers.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2023

2022
Bounding the Error of Discretized Langevin Algorithms for Non-Strongly Log-Concave Targets.
J. Mach. Learn. Res., 2022

Nearly minimax robust estimator of the mean vector by iterative spectral dimension reduction.
CoRR, 2022

Risk bounds for aggregated shallow neural networks using Gaussian priors.
Proceedings of the Conference on Learning Theory, 2-5 July 2022, London, UK., 2022

2021
Optimal detection of the feature matching map in presence of noise and outliers.
CoRR, 2021

Statistical guarantees for generative models without domination.
Proceedings of the Algorithmic Learning Theory, 2021

2020
Penalized Langevin dynamics with vanishing penalty for smooth and log-concave targets.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

A nonasymptotic law of iterated logarithm for general M-estimators.
Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

2019
Outlier-robust estimation of a sparse linear model using 𝓁<sub>1</sub>-penalized Huber's M-estimator.
CoRR, 2019

A nonasymptotic law of iterated logarithm for robust online estimators.
CoRR, 2019

Minimax rates in outlier-robust estimation of discrete models.
CoRR, 2019

Outlier-robust estimation of a sparse linear model using \ell_1-penalized Huber's M-estimator.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

2018
On sampling from a log-concave density using kinetic Langevin diffusions.
CoRR, 2018

2017
User-friendly guarantees for the Langevin Monte Carlo with inaccurate gradient.
CoRR, 2017

Further and stronger analogy between sampling and optimization: Langevin Monte Carlo and gradient descent.
Proceedings of the 30th Conference on Learning Theory, 2017

2016
Minimax Rates in Permutation Estimation for Feature Matching.
J. Mach. Learn. Res., 2016

On the Exponentially Weighted Aggregate with the Laplace Prior.
CoRR, 2016

2013
Learning Heteroscedastic Models by Convex Programming under Group Sparsity.
Proceedings of the 30th International Conference on Machine Learning, 2013

Permutation estimation and minimax rates of identifiability.
Proceedings of the Sixteenth International Conference on Artificial Intelligence and Statistics, 2013

2012
Wilks' phenomenon and penalized likelihood-ratio test for nonparametric curve registration.
Proceedings of the Fifteenth International Conference on Artificial Intelligence and Statistics, 2012

Robust Estimation for an Inverse Problem Arising in Multiview Geometry.
J. Math. Imaging Vis., 2012

Sparse regression learning by aggregation and Langevin Monte-Carlo.
J. Comput. Syst. Sci., 2012

On Camera Calibration with Linear Programming and Loop Constraint Linearization.
Int. J. Comput. Vis., 2012

Fused sparsity and robust estimation for linear models with unknown variance.
Proceedings of the Advances in Neural Information Processing Systems 25: 26th Annual Conference on Neural Information Processing Systems 2012. Proceedings of a meeting held December 3-6, 2012

2011
Optimal aggregation of affine estimators.
Proceedings of the COLT 2011, 2011

Tight conditions for consistent variable selection in high dimensional nonparametric regression.
Proceedings of the COLT 2011, 2011

Image denoising with patch based PCA: local versus global.
Proceedings of the British Machine Vision Conference, 2011

Competing against the Best Nearest Neighbor Filter in Regression.
Proceedings of the Algorithmic Learning Theory - 22nd International Conference, 2011

2010
Exploiting Loops in the Graph of Trifocal Tensors for Calibrating a Network of Cameras.
Proceedings of the Computer Vision, 2010

Towards Optimal Naive Bayes Nearest Neighbor.
Proceedings of the Computer Vision, 2010

2009
L<sub>1</sub>-Penalized Robust Estimation for a Class of Inverse Problems Arising in Multiview Geometry.
Proceedings of the Advances in Neural Information Processing Systems 22: 23rd Annual Conference on Neural Information Processing Systems 2009. Proceedings of a meeting held 7-10 December 2009, 2009

Sparse learning approach to the problem of robust estimation of camera locations.
Proceedings of the 12th IEEE International Conference on Computer Vision Workshops, 2009

2008
Aggregation by exponential weighting, sharp PAC-Bayesian bounds and sparsity.
Mach. Learn., 2008

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

2007
Aggregation by Exponential Weighting and Sharp Oracle Inequalities.
Proceedings of the Learning Theory, 20th Annual Conference on Learning Theory, 2007


  Loading...