| Publication | Date of Publication | Type |
|---|
Near-optimal inference in adaptive linear regression
The Annals of Statistics | 2026-01-26 | Paper |
Semiparametric inference based on adaptively collected data
The Annals of Statistics | 2025-08-07 | Paper |
Instability, computational efficiency and statistical accuracy
Journal of Machine Learning Research (JMLR) | 2025-08-05 | Paper |
| Local privacy and statistical minimax rates | 2025-05-20 | Paper |
Noisy recovery from random linear observations: sharp minimax rates under elliptical constraints
The Annals of Statistics | 2025-01-29 | Paper |
Optimal policy evaluation using kernel-based temporal difference methods
The Annals of Statistics | 2025-01-03 | Paper |
A diffusion process perspective on posterior contraction rates for parameters
SIAM Journal on Mathematics of Data Science | 2024-08-06 | Paper |
Optimal Oracle Inequalities for Projected Fixed-Point Equations, with Applications to Policy Evaluation
Mathematics of Operations Research | 2024-03-01 | Paper |
Optimally tackling covariate shift in RKHS-based nonparametric regression
The Annals of Statistics | 2023-07-19 | Paper |
Minimax Off-Policy Evaluation for Multi-Armed Bandits
IEEE Transactions on Information Theory | 2022-08-19 | Paper |
Improved bounds for discretization of Langevin diffusions: near-optimal rates without convexity
Bernoulli | 2022-05-16 | Paper |
Improved bounds for discretization of Langevin diffusions: near-optimal rates without convexity
Bernoulli | 2022-05-16 | Paper |
| Optimal and instance-dependent guarantees for Markovian linear stochastic approximation | 2021-12-23 | Paper |
Is Temporal Difference Learning Optimal? An Instance-Dependent Analysis
SIAM Journal on Mathematics of Data Science | 2021-11-03 | Paper |
A Permutation-Based Model for Crowd Labeling: Optimal Estimation and Robustness
IEEE Transactions on Information Theory | 2021-07-23 | Paper |
scientific article; zbMATH DE number 7370559 (Why is no real title available?)
(available as arXiv preprint) | 2021-07-09 | Paper |
| scientific article; zbMATH DE number 7370559 (Why is no real title available?) | 2021-07-09 | Paper |
Singularity, misspecification and the convergence rate of EM
The Annals of Statistics | 2021-02-26 | Paper |
Singularity, misspecification and the convergence rate of EM
The Annals of Statistics | 2021-02-26 | Paper |
Towards optimal estimation of bivariate isotonic matrices with unknown permutations
The Annals of Statistics | 2021-02-26 | Paper |
Towards optimal estimation of bivariate isotonic matrices with unknown permutations
The Annals of Statistics | 2021-02-26 | Paper |
Instance-Dependent ℓ<sub>∞</sub>-Bounds for Policy Evaluation in Tabular Reinforcement Learning
IEEE Transactions on Information Theory | 2021-02-22 | Paper |
Function-specific mixing times and concentration away from equilibrium
Bayesian Analysis | 2021-02-09 | Paper |
Function-specific mixing times and concentration away from equilibrium
Bayesian Analysis | 2021-02-09 | Paper |
Derivative-free methods for policy optimization: guarantees for linear quadratic systems
(available as arXiv preprint) | 2020-10-05 | Paper |
| Derivative-free methods for policy optimization: guarantees for linear quadratic systems | 2020-10-05 | Paper |
Fast mixing of Metropolized Hamiltonian Monte Carlo: benefits of multi-step gradients
(available as arXiv preprint) | 2020-10-05 | Paper |
| Fast mixing of Metropolized Hamiltonian Monte Carlo: benefits of multi-step gradients | 2020-10-05 | Paper |
The Local Geometry of Testing in Ellipses: Tight Control via Localized Kolmogorov Widths
IEEE Transactions on Information Theory | 2020-09-29 | Paper |
From Gauss to Kolmogorov: localized measures of complexity for ellipses
Electronic Journal of Statistics | 2020-09-14 | Paper |
From Gauss to Kolmogorov: localized measures of complexity for ellipses
Electronic Journal of Statistics | 2020-09-14 | Paper |
Worst-case versus average-case design for estimation from partial pairwise comparisons
The Annals of Statistics | 2020-08-28 | Paper |
Worst-case versus average-case design for estimation from partial pairwise comparisons
The Annals of Statistics | 2020-08-28 | Paper |
Optimal rates and trade-offs in multiple testing
STATISTICA SINICA | 2020-05-14 | Paper |
| Log-concave sampling: Metropolis-Hastings algorithms are fast | 2020-02-07 | Paper |
Log-concave sampling: Metropolis-Hastings algorithms are fast
(available as arXiv preprint) | 2020-02-07 | Paper |
| Low permutation-rank matrices: structural properties and noisy completion | 2020-02-07 | Paper |
Low permutation-rank matrices: structural properties and noisy completion
(available as arXiv preprint) | 2020-02-07 | Paper |
| Convergence guarantees for a class of non-convex and non-smooth optimization problems | 2020-02-07 | Paper |
Convergence guarantees for a class of non-convex and non-smooth optimization problems
(available as arXiv preprint) | 2020-02-07 | Paper |
Early Stopping for Kernel Boosting Algorithms: A General Analysis With Localized Complexities
IEEE Transactions on Information Theory | 2020-01-28 | Paper |
Active ranking from pairwise comparisons and when parametric assumptions do not help
The Annals of Statistics | 2020-01-15 | Paper |
Active ranking from pairwise comparisons and when parametric assumptions do not help
The Annals of Statistics | 2020-01-15 | Paper |
| Sampling for Bayesian Mixture Models: MCMC with Polynomial-Time Mixing | 2019-12-11 | Paper |
A unified treatment of multiple testing with prior knowledge using the p-filter
The Annals of Statistics | 2019-10-09 | Paper |
A unified treatment of multiple testing with prior knowledge using the p-filter
The Annals of Statistics | 2019-10-09 | Paper |
| A Diffusion Process Perspective on Posterior Contraction Rates for Parameters | 2019-09-03 | Paper |
High-Order Langevin Diffusion Yields an Accelerated MCMC Algorithm
(available as arXiv preprint) | 2019-08-28 | Paper |
Feeling the Bern: Adaptive Estimators for Bernoulli Probabilities of Pairwise Comparisons
IEEE Transactions on Information Theory | 2019-07-19 | Paper |
Network Coding for Distributed Storage Systems
IEEE Transactions on Information Theory | 2019-07-08 | Paper |
A sequential algorithm for false discovery rate control on directed acyclic graphs
Biometrika | 2019-05-08 | Paper |
The geometry of hypothesis testing over convex cones: generalized likelihood ratio tests and minimax radii
The Annals of Statistics | 2019-03-06 | Paper |
The geometry of hypothesis testing over convex cones: generalized likelihood ratio tests and minimax radii
The Annals of Statistics | 2019-03-06 | Paper |
| High-dimensional statistics. A non-asymptotic viewpoint | 2019-02-13 | Paper |
| Simple, Robust and Optimal Ranking from Pairwise Comparisons | 2018-11-22 | Paper |
Simple, Robust and Optimal Ranking from Pairwise Comparisons
(available as arXiv preprint) | 2018-11-22 | Paper |
| Fast MCMC sampling algorithms on polytopes | 2018-11-21 | Paper |
Fast MCMC sampling algorithms on polytopes
(available as arXiv preprint) | 2018-11-21 | Paper |
Rejoinder
Journal of the American Statistical Association | 2018-10-23 | Paper |
Minimax Optimal Procedures for Locally Private Estimation
Journal of the American Statistical Association | 2018-10-23 | Paper |
Linear Regression With Shuffled Data: Statistical and Computational Limits of Permutation Recovery
IEEE Transactions on Information Theory | 2018-09-14 | Paper |
On kernel methods for covariates that are rankings
Electronic Journal of Statistics | 2018-08-14 | Paper |
On kernel methods for covariates that are rankings
Electronic Journal of Statistics | 2018-08-14 | Paper |
Network-Based Consensus Averaging With General Noisy Channels
IEEE Transactions on Signal Processing | 2018-07-18 | Paper |
Convergence Analysis of Reweighted Sum-Product Algorithms
IEEE Transactions on Signal Processing | 2018-06-27 | Paper |
Geographic Gossip: Efficient Averaging for Sensor Networks
IEEE Transactions on Signal Processing | 2018-06-27 | Paper |
| Statistical and computational guarantees for the Baum-Welch algorithm | 2018-04-17 | Paper |
Statistical and computational guarantees for the Baum-Welch algorithm
(available as arXiv preprint) | 2018-04-17 | Paper |
Support recovery without incoherence: a case for nonconvex regularization
The Annals of Statistics | 2018-02-14 | Paper |
Support recovery without incoherence: a case for nonconvex regularization
The Annals of Statistics | 2018-02-14 | Paper |
Rejoinder
Sankhyā. Series A | 2018-01-05 | Paper |
On concentration for (regularized) empirical risk minimization
Sankhyā. Series A | 2018-01-05 | Paper |
| Constrained forms of statistical minimax: computation, communication, and privacy | 2017-11-06 | Paper |
Log-determinant relaxation for approximate inference in discrete Markov random fields
IEEE Transactions on Signal Processing | 2017-10-30 | Paper |
Embedded Trees: Estimation of Gaussian Processes on Graphs with Cycles
IEEE Transactions on Signal Processing | 2017-09-20 | Paper |
Nonparametric decentralized detection using kernel methods
IEEE Transactions on Signal Processing | 2017-09-20 | Paper |
Dual Averaging for Distributed Optimization: Convergence Analysis and Network Scaling
IEEE Transactions on Automatic Control | 2017-09-08 | Paper |
Low-Density Graph Codes That Are Optimal for Binning and Coding With Side Information
IEEE Transactions on Information Theory | 2017-08-08 | Paper |
Guessing Facets: Polytope Structure and Improved LP Decoder
IEEE Transactions on Information Theory | 2017-08-08 | Paper |
Sharp Thresholds for High-Dimensional and Noisy Sparsity Recovery Using $\ell _{1}$-Constrained Quadratic Programming (Lasso)
IEEE Transactions on Information Theory | 2017-08-08 | Paper |
Information-Theoretic Limits on Sparsity Recovery in the High-Dimensional and Noisy Setting
IEEE Transactions on Information Theory | 2017-08-08 | Paper |
Randomized sketches for kernels: fast and optimal nonparametric regression
The Annals of Statistics | 2017-08-03 | Paper |
Randomized sketches for kernels: fast and optimal nonparametric regression
The Annals of Statistics | 2017-08-03 | Paper |
Estimating Divergence Functionals and the Likelihood Ratio by Convex Risk Minimization
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
Information-Theoretic Limits on Sparse Signal Recovery: Dense versus Sparse Measurement Matrices
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
Lossy Source Compression Using Low-Density Generator Matrix Codes: Analysis and Algorithms
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
Analysis of Absorbing Sets and Fully Absorbing Sets of Array-Based LDPC Codes
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
Minimax Rates of Estimation for High-Dimensional Linear Regression Over \ell_q-Balls
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
Information-Theoretic Lower Bounds on the Oracle Complexity of Stochastic Convex Optimization
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
Simultaneous Support Recovery in High Dimensions: Benefits and Perils of Block $\ell _{1}/\ell _{\infty} $-Regularization
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
Information-Theoretic Limits of Selecting Binary Graphical Models in High Dimensions
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
Stochastically Transitive Models for Pairwise Comparisons: Statistical and Computational Issues
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Stochastic Belief Propagation: A Low-Complexity Alternative to the Sum-Product Algorithm
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Statistical guarantees for the EM algorithm: from population to sample-based analysis
The Annals of Statistics | 2017-05-02 | Paper |
Statistical guarantees for the EM algorithm: from population to sample-based analysis
The Annals of Statistics | 2017-05-02 | Paper |
Randomized Sketches of Convex Programs With Sharp Guarantees
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Optimal Rates for Zero-Order Convex Optimization: The Power of Two Function Evaluations
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Optimal prediction for sparse linear models? Lower bounds for coordinate-separable M-estimators
Electronic Journal of Statistics | 2017-04-07 | Paper |
Optimal prediction for sparse linear models? Lower bounds for coordinate-separable M-estimators
Electronic Journal of Statistics | 2017-04-07 | Paper |
Newton Sketch: A Near Linear-Time Optimization Algorithm with Linear-Quadratic Convergence
SIAM Journal on Optimization | 2017-03-01 | Paper |
On the computational complexity of high-dimensional Bayesian variable selection
The Annals of Statistics | 2017-02-13 | Paper |
| A practical scheme and fast algorithm to tune the Lasso with optimality guarantees | 2017-01-05 | Paper |
A practical scheme and fast algorithm to tune the Lasso with optimality guarantees
(available as arXiv preprint) | 2017-01-05 | Paper |
Iterative Hessian sketch: fast and accurate solution approximation for constrained least-squares
Journal of Machine Learning Research (JMLR) | 2016-06-06 | Paper |
Iterative Hessian sketch: fast and accurate solution approximation for constrained least-squares
Journal of Machine Learning Research (JMLR) | 2016-06-06 | Paper |
Estimation from pairwise comparisons: sharp minimax bounds with topology dependence
Journal of Machine Learning Research (JMLR) | 2016-06-06 | Paper |
Estimation from pairwise comparisons: sharp minimax bounds with topology dependence
Journal of Machine Learning Research (JMLR) | 2016-06-06 | Paper |
A unified framework for high-dimensional analysis of M-estimators with decomposable regularizers
Statistical Science | 2016-03-03 | Paper |
A unified framework for high-dimensional analysis of M-estimators with decomposable regularizers
Statistical Science | 2016-03-03 | Paper |
Divide and conquer kernel ridge regression: a distributed algorithm with minimax optimal rates
Journal of Machine Learning Research (JMLR) | 2016-02-19 | Paper |
Divide and conquer kernel ridge regression: a distributed algorithm with minimax optimal rates
Journal of Machine Learning Research (JMLR) | 2016-02-19 | Paper |
Graphical Models and Message-Passing Algorithms: Some Introductory Lectures
Lecture Notes in Mathematics | 2016-01-19 | Paper |
| Regularized \(M\)-estimators with nonconvexity: statistical and algorithmic theory for local optima | 2015-08-17 | Paper |
Regularized \(M\)-estimators with nonconvexity: statistical and algorithmic theory for local optima
(available as arXiv preprint) | 2015-08-17 | Paper |
Privacy aware learning
Journal of the ACM | 2015-08-14 | Paper |
| scientific article; zbMATH DE number 6438182 (Why is no real title available?) | 2015-05-21 | Paper |
The geometry of kernelized spectral clustering
The Annals of Statistics | 2015-05-11 | Paper |
The geometry of kernelized spectral clustering
The Annals of Statistics | 2015-05-11 | Paper |
| Probabilistic analysis of linear programming decoding | 2014-12-18 | Paper |
| Early stopping and non-parametric regression: an optimal data-dependent stopping rule | 2014-12-08 | Paper |
Early stopping and non-parametric regression: an optimal data-dependent stopping rule
(available as arXiv preprint) | 2014-12-08 | Paper |
| Communication-efficient algorithms for statistical optimization | 2014-12-08 | Paper |
Communication-efficient algorithms for statistical optimization
(available as arXiv preprint) | 2014-12-08 | Paper |
| Belief propagation for continuous state spaces: stochastic message-passing with quantitative guarantees | 2014-12-08 | Paper |
Belief propagation for continuous state spaces: stochastic message-passing with quantitative guarantees
(available as arXiv preprint) | 2014-12-08 | Paper |
| A new look at survey propagation and its generalizations | 2014-10-13 | Paper |
Fast global convergence of gradient methods for high-dimensional statistical recovery
The Annals of Statistics | 2014-09-15 | Paper |
Fast global convergence of gradient methods for high-dimensional statistical recovery
The Annals of Statistics | 2014-09-15 | Paper |
Sampled forms of functional PCA in reproducing kernel Hilbert spaces
The Annals of Statistics | 2014-09-15 | Paper |
Sampled forms of functional PCA in reproducing kernel Hilbert spaces
The Annals of Statistics | 2014-09-15 | Paper |
Structure estimation for discrete graphical models: generalized covariance matrices and their inverses
The Annals of Statistics | 2014-04-04 | Paper |
Structure estimation for discrete graphical models: generalized covariance matrices and their inverses
The Annals of Statistics | 2014-04-04 | Paper |
| Minimax-optimal rates for sparse additive models over kernel classes via convex programming | 2014-04-01 | Paper |
Minimax-optimal rates for sparse additive models over kernel classes via convex programming
(available as arXiv preprint) | 2014-04-01 | Paper |
| Restricted strong convexity and weighted matrix completion: optimal bounds with noise | 2014-04-01 | Paper |
Restricted strong convexity and weighted matrix completion: optimal bounds with noise
(available as arXiv preprint) | 2014-04-01 | Paper |
High-dimensional covariance estimation by minimizing \(\ell _{1}\)-penalized log-determinant divergence
Electronic Journal of Statistics | 2013-05-28 | Paper |
High-dimensional covariance estimation by minimizing \(\ell _{1}\)-penalized log-determinant divergence
Electronic Journal of Statistics | 2013-05-28 | Paper |
Discussion: Latent variable graphical model selection via convex optimization
The Annals of Statistics | 2013-03-07 | Paper |
Discussion: Latent variable graphical model selection via convex optimization
The Annals of Statistics | 2013-03-07 | Paper |
High-dimensional regression with noisy and missing data: provable guarantees with nonconvexity
The Annals of Statistics | 2012-12-10 | Paper |
High-dimensional regression with noisy and missing data: provable guarantees with nonconvexity
The Annals of Statistics | 2012-12-10 | Paper |
Randomized smoothing for stochastic optimization
SIAM Journal on Optimization | 2012-09-12 | Paper |
Noisy matrix decomposition via convex relaxation: optimal rates in high dimensions
The Annals of Statistics | 2012-08-29 | Paper |
Noisy matrix decomposition via convex relaxation: optimal rates in high dimensions
The Annals of Statistics | 2012-08-29 | Paper |
High-dimensional variable selection with sparse random projections: measurement sparsity and statistical efficiency
Journal of Machine Learning Research (JMLR) | 2012-07-13 | Paper |
High-dimensional variable selection with sparse random projections: measurement sparsity and statistical efficiency
Journal of Machine Learning Research (JMLR) | 2012-07-13 | Paper |
Restricted eigenvalue properties for correlated Gaussian designs
Journal of Machine Learning Research (JMLR) | 2012-07-13 | Paper |
Message-passing for graph-structured linear programs: proximal methods and rounding schemes
Journal of Machine Learning Research (JMLR) | 2012-07-13 | Paper |
Approximation properties of certain operator-induced norms on Hilbert spaces
Journal of Approximation Theory | 2012-03-22 | Paper |
| Estimating the ``wrong'' graphical model: benefits in the computation-limited setting | 2011-10-12 | Paper |
Estimation of (near) low-rank matrices with noise and high-dimensional scaling
The Annals of Statistics | 2011-06-29 | Paper |
Support union recovery in high-dimensional multivariate regression
The Annals of Statistics | 2011-04-05 | Paper |
Graphical models, exponential families, and variational inference
Foundations and Trends® in Machine Learning | 2010-08-14 | Paper |
High-dimensional Ising model selection using \(\ell _{1}\)-regularized logistic regression
The Annals of Statistics | 2010-05-26 | Paper |
High-dimensional analysis of semidefinite relaxations for sparse principal components
The Annals of Statistics | 2009-08-19 | Paper |
On surrogate loss functions and \(f\)-divergences
The Annals of Statistics | 2009-06-04 | Paper |
On Optimal Quantization Rules for Some Problems in Sequential Decentralized Detection
IEEE Transactions on Information Theory | 2009-02-24 | Paper |
Probabilistic analysis of linear programming decoding
IEEE Transactions on Information Theory | 2009-02-24 | Paper |
LP Decoding Corrects a Constant Fraction of Errors
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Using Linear Programming to Decode Binary Linear Codes
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
A New Class of Upper Bounds on the Log Partition Function
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Image denoising using scale mixtures of gaussians in the wavelet domain
IEEE Transactions on Image Processing | 2008-12-21 | Paper |
MAP Estimation Via Agreement on Trees: Message-Passing and Linear Programming
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
A new look at survey propagation and its generalizations
Journal of the ACM | 2008-12-21 | Paper |
| High-Dimensional Graphical Model Selection Using \ell₁-Regularized Logistic Regression | 2008-04-25 | Paper |
Data association based on optimization in graphical models with application to sensor networks
Mathematical and Computer Modelling | 2008-02-26 | Paper |
Tree-based reparameterization framework for analysis of sum-product and related algorithms
IEEE Transactions on Information Theory | 2005-06-01 | Paper |
Random cascades on wavelet trees and their use in analyzing and modeling natural images
Applied and Computational Harmonic Analysis | 2001-10-14 | Paper |
