default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArnak S. Dalalyan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c23]Lu Yu, Avetik G. Karagulyan, Arnak S. Dalalyan:
Langevin Monte Carlo for strongly log-concave distributions: Randomized midpoint revisited. ICLR 2024- [c22]Elen Vardanyan, Sona Hunanyan, Tigran Galstyan, Arshak Minasyan, Arnak S. Dalalyan:
Statistically Optimal Generative Modeling with Maximum Deviation from the Empirical Distribution. ICML 2024 - [i16]Lu Yu, Arnak S. Dalalyan:
Parallelized Midpoint Randomization for Langevin Monte Carlo. CoRR abs/2402.14434 (2024) - 2023
- [c21]Arshak Minasyan, Tigran Galstyan, Sona Hunanyan, Arnak S. Dalalyan:
Matching Map Recovery with an Unknown Number of Outliers. AISTATS 2023: 891-906 - [i15]Etienne Donier-Meroz, Arnak S. Dalalyan, Francis Kramarz, Philippe Choné, Xavier D'Haultfoeuille:
Graphon Estimation in bipartite graphs with observable edge labels and unobservable node labels. CoRR abs/2304.03590 (2023) - [i14]Lu Yu, Avetik G. Karagulyan, Arnak S. Dalalyan:
Langevin Monte Carlo for strongly log-concave distributions: Randomized midpoint revisited. CoRR abs/2306.08494 (2023) - [i13]Elen Vardanyan, Arshak Minasyan, Sona Hunanyan, Tigran Galstyan, Arnak S. Dalalyan:
Guaranteed Optimal Generative Modeling with Maximum Deviation from the Empirical Distribution. CoRR abs/2307.16422 (2023) - 2022
- [j7]Arnak S. Dalalyan, Avetik G. Karagulyan, Lionel Riou-Durand:
Bounding the Error of Discretized Langevin Algorithms for Non-Strongly Log-Concave Targets. J. Mach. Learn. Res. 23: 235:1-235:38 (2022) - [c20]Laura Tinsi, Arnak S. Dalalyan:
Risk bounds for aggregated shallow neural networks using Gaussian priors. COLT 2022: 227-253 - [i12]Amir-Hossein Bateni, Arshak Minasyan, Arnak S. Dalalyan:
Nearly minimax robust estimator of the mean vector by iterative spectral dimension reduction. CoRR abs/2204.02323 (2022) - [i11]Arshak Minasyan, Tigran Galstyan, Sona Hunanyan, Arnak S. Dalalyan:
Matching Map Recovery with an Unknown Number of Outliers. CoRR abs/2210.13354 (2022) - 2021
- [c19]Nicolas Schreuder, Victor-Emmanuel Brunel, Arnak S. Dalalyan:
Statistical guarantees for generative models without domination. ALT 2021: 1051-1071 - [i10]Tigran Galstyan, Arshak Minasyan, Arnak S. Dalalyan:
Optimal detection of the feature matching map in presence of noise and outliers. CoRR abs/2106.07044 (2021) - 2020
- [c18]Arnak S. Dalalyan, Nicolas Schreuder, Victor-Emmanuel Brunel:
A nonasymptotic law of iterated logarithm for general M-estimators. AISTATS 2020: 1331-1341 - [c17]Avetik G. Karagulyan, Arnak S. Dalalyan:
Penalized Langevin dynamics with vanishing penalty for smooth and log-concave targets. NeurIPS 2020 - [i9]Avetik G. Karagulyan, Arnak S. Dalalyan:
Penalized Langevin dynamics with vanishing penalty for smooth and log-concave targets. CoRR abs/2006.13998 (2020)
2010 – 2019
- 2019
- [c16]Arnak S. Dalalyan, Philip Thompson:
Outlier-robust estimation of a sparse linear model using \ell_1-penalized Huber's M-estimator. NeurIPS 2019: 13188-13198 - [i8]Amir-Hossein Bateni, Arnak S. Dalalyan:
Minimax rates in outlier-robust estimation of discrete models. CoRR abs/1902.04650 (2019) - [i7]Victor-Emmanuel Brunel, Arnak S. Dalalyan, Nicolas Schreuder:
A nonasymptotic law of iterated logarithm for robust online estimators. CoRR abs/1903.06576 (2019) - [i6]Arnak S. Dalalyan, Philip Thompson:
Outlier-robust estimation of a sparse linear model using 𝓁1-penalized Huber's M-estimator. CoRR abs/1904.06288 (2019) - [i5]Arnak S. Dalalyan, Lionel Riou-Durand, Avetik G. Karagulyan:
Bounding the error of discretized Langevin algorithms for non-strongly log-concave targets. CoRR abs/1906.08530 (2019) - 2018
- [i4]Arnak S. Dalalyan, Lionel Riou-Durand:
On sampling from a log-concave density using kinetic Langevin diffusions. CoRR abs/1807.09382 (2018) - 2017
- [c15]Arnak S. Dalalyan:
Further and stronger analogy between sampling and optimization: Langevin Monte Carlo and gradient descent. COLT 2017: 678-689 - [i3]Arnak S. Dalalyan, Avetik G. Karagulyan:
User-friendly guarantees for the Langevin Monte Carlo with inaccurate gradient. CoRR abs/1710.00095 (2017) - 2016
- [j6]Olivier Collier, Arnak S. Dalalyan:
Minimax Rates in Permutation Estimation for Feature Matching. J. Mach. Learn. Res. 17: 6:1-6:31 (2016) - [i2]Arnak S. Dalalyan, Edwin Grappin, Quentin Paris:
On the Exponentially Weighted Aggregate with the Laplace Prior. CoRR abs/1611.08483 (2016) - 2013
- [c14]Olivier Collier, Arnak S. Dalalyan:
Permutation estimation and minimax rates of identifiability. AISTATS 2013: 10-19 - [c13]Arnak S. Dalalyan, Mohamed Hebiri, Katia Meziani, Joseph Salmon:
Learning Heteroscedastic Models by Convex Programming under Group Sparsity. ICML (3) 2013: 379-387 - [i1]Olivier Collier, Arnak S. Dalalyan:
Minimax rates in permutation estimation for feature matching. CoRR abs/1310.4661 (2013) - 2012
- [j5]Jérôme Courchay, Arnak S. Dalalyan, Renaud Keriven, Peter F. Sturm:
On Camera Calibration with Linear Programming and Loop Constraint Linearization. Int. J. Comput. Vis. 97(1): 71-90 (2012) - [j4]Arnak S. Dalalyan, Alexandre B. Tsybakov:
Sparse regression learning by aggregation and Langevin Monte-Carlo. J. Comput. Syst. Sci. 78(5): 1423-1443 (2012) - [j3]Arnak S. Dalalyan, Renaud Keriven:
Robust Estimation for an Inverse Problem Arising in Multiview Geometry. J. Math. Imaging Vis. 43(1): 10-23 (2012) - [c12]Arnak S. Dalalyan, Yin Chen:
Fused sparsity and robust estimation for linear models with unknown variance. NIPS 2012: 1268-1276 - [c11]Arnak S. Dalalyan, Olivier Collier:
Wilks' phenomenon and penalized likelihood-ratio test for nonparametric curve registration. AISTATS 2012: 264-272 - 2011
- [c10]Arnak S. Dalalyan, Joseph Salmon:
Competing against the Best Nearest Neighbor Filter in Regression. ALT 2011: 129-143 - [c9]Charles-Alban Deledalle, Joseph Salmon, Arnak S. Dalalyan:
Image denoising with patch based PCA: local versus global. BMVC 2011: 1-10 - [c8]Laëtitia Comminges, Arnak S. Dalalyan:
Tight conditions for consistent variable selection in high dimensional nonparametric regression. COLT 2011: 187-206 - [c7]Joseph Salmon, Arnak S. Dalalyan:
Optimal aggregation of affine estimators. COLT 2011: 635-660 - 2010
- [c6]Jérôme Courchay, Arnak S. Dalalyan, Renaud Keriven, Peter F. Sturm:
Exploiting Loops in the Graph of Trifocal Tensors for Calibrating a Network of Cameras. ECCV (2) 2010: 85-99 - [c5]Régis Behmo, Paul Marcombes, Arnak S. Dalalyan, Véronique Prinet:
Towards Optimal Naive Bayes Nearest Neighbor. ECCV (4) 2010: 171-184
2000 – 2009
- 2009
- [c4]Arnak S. Dalalyan, Alexandre B. Tsybakov:
Sparse Regression Learning by Aggregation and Langevin Monte-Carlo. COLT 2009 - [c3]Arnak S. Dalalyan, Renaud Keriven:
Sparse learning approach to the problem of robust estimation of camera locations. ICCV Workshops 2009: 436-443 - [c2]Arnak S. Dalalyan, Renaud Keriven:
L1-Penalized Robust Estimation for a Class of Inverse Problems Arising in Multiview Geometry. NIPS 2009: 441-449 - 2008
- [j2]Arnak S. Dalalyan, Anatoli B. Juditsky, Vladimir G. Spokoiny:
A New Algorithm for Estimating the Effective Dimension-Reduction Subspace. J. Mach. Learn. Res. 9: 1647-1678 (2008) - [j1]Arnak S. Dalalyan, Alexandre B. Tsybakov:
Aggregation by exponential weighting, sharp PAC-Bayesian bounds and sparsity. Mach. Learn. 72(1-2): 39-61 (2008) - 2007
- [c1]Arnak S. Dalalyan, Alexandre B. Tsybakov:
Aggregation by Exponential Weighting and Sharp Oracle Inequalities. COLT 2007: 97-111
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-13 00:41 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
