research
∙
09/11/2023
On the quality of randomized approximations of Tukey's depth
Tukey's depth (or halfspace depth) is a widely used measure of centralit...
share
research
∙
06/20/2023
Increasing paths in random temporal graphs
We consider random temporal graphs, a version of the classical Erdős–Rén...
research
∙
06/02/2023
Broadcasting in random recursive dags
A uniform k-dag generalizes the uniform random recursive tree by picking...
research
∙
05/31/2023
Online-to-PAC Conversions: Generalization Bounds via Regret Analysis
We present a new framework for deriving bounds on the generalization bou...
research
∙
10/19/2022
Subtractive random forests
Motivated by online recommendation systems, we study a family of random ...
research
∙
07/29/2022
Archaeology of random recursive dags and Cooper-Frieze random networks
We study the problem of finding the root vertex in large growing network...
research
∙
02/10/2022
Generalization Bounds via Convex Analysis
Since the celebrated works of Russo and Zou (2016,2019) and Xu and Ragin...
research
∙
11/25/2021
Bandit problems with fidelity rewards
The fidelity bandits problem is a variant of the K-armed bandit problem ...
research
∙
09/24/2021
Learning to maximize global influence from local observations
We study a family online influence maximization problems where in a sequ...
research
∙
06/13/2021
Inferring the mixing properties of an ergodic process
We propose strongly consistent estimators of the ℓ_1 norm of the sequenc...
research
∙
10/22/2020
Multivariate mean estimation with direction-dependent accuracy
We consider the problem of estimating the mean of a random vector based ...
research
∙
10/22/2020
On Mean Estimation for Heteroscedastic Random Variables
We study the problem of estimating the common mean μ of n independent sy...
research
∙
07/26/2019
Robust multivariate mean estimation: the optimality of trimmed mean
We consider the problem of estimating the mean of a random vector based ...
research
∙
06/26/2019
Benign Overfitting in Linear Regression
The phenomenon of benign overfitting is one of the key mysteries uncover...
research
∙
06/22/2019
Structure learning in graphical models by covariance queries
We study the problem of recovering the structure underlying large Gaussi...
research
∙
06/10/2019
Mean estimation and regression under heavy-tailed distributions--a survey
We survey some of the recent advances in mean estimation and regression ...
research
∙
08/25/2018
Multiplayer bandits without observing collision information
We study multiplayer stochastic multi-armed bandit problems in which the...
research
∙
06/16/2018
Near-optimal mean estimators with respect to general norms
We study the problem of estimating the mean of a random vector in R^d ba...
research
∙
05/28/2018
Online Influence Maximization with Local Observations
We consider an online influence maximization problem in which a decision...
research
∙
12/21/2017
Local optima of the Sherrington-Kirkpatrick Hamiltonian
We study local optima of the Hamiltonian of the Sherrington-Kirkpatrick ...
research
∙
12/19/2017
A remark on "Robust machine learning by median-of-means"
We explore the recent results announced in "Robust machine learning by m...
research
∙
10/16/2017
On the Hardness of Inventory Management with Censored Demand Data
We consider a repeated newsvendor problem where the inventory manager ha...
research
∙
05/29/2017
Boltzmann Exploration Done Right
Boltzmann exploration is a classic strategy for sequential decision-maki...
research
∙
02/28/2017
Algorithmic stability and hypothesis complexity
We introduce a notion of algorithmic stability of learning algorithms---...
research
∙
02/20/2017
An Improved Parametrization and Analysis of the EXP3++ Algorithm for Stochastic and Adversarial Bandits
We present a new strategy for gap estimation in randomized algorithms fo...
research
∙
02/01/2017
Sub-Gaussian estimators of the mean of a random vector
We study the problem of estimating the mean of a random vector X given a...
research
∙
01/15/2017
Regularization, sparse recovery, and median-of-means tournaments
A regularized risk minimization procedure for regression function estima...
research
∙
09/08/2012
Bandits with heavy tail
The stochastic multi-armed bandit problem is well understood when the re...
research
∙
04/20/2012
Regret in Online Combinatorial Optimization
We address online linear optimization problems when the possible actions...
research
∙
02/15/2012
Mirror Descent Meets Fixed Share (and feels no regret)
Mirror descent with an entropic regularizer is known to achieve shifting...
research
∙
05/24/2011
