
-
Smooth Bandit Optimization: Generalization to Hölder Space
We consider bandit optimization of a smooth reward function, where the g...
read it
-
A Large Scale Randomized Controlled Trial on Herding in Peer-Review Discussions
Peer review is the backbone of academia and humans constitute a cornerst...
read it
-
A Novice-Reviewer Experiment to Address Scarcity of Qualified Reviewers in Large Conferences
Conference peer review constitutes a human-computation process whose imp...
read it
-
Prior and Prejudice: The Novice Reviewers' Bias against Resubmissions in Conference Peer Review
Modern machine learning and computer science conferences are experiencin...
read it
-
Catch Me if I Can: Detecting Strategic Behaviour in Peer Assessment
We consider the issue of strategic behaviour in various peer-assessment ...
read it
-
Two-Sample Testing on Ranked Preference Data and the Role of Modeling Assumptions
A number of applications require two-sample testing on ranked preference...
read it
-
Preference-based Reinforcement Learning with Finite-Time Guarantees
Preference-based Reinforcement Learning (PbRL) replaces reward values in...
read it
-
On Testing for Biases in Peer Review
We consider the issue of biases in scholarly research, specifically, in ...
read it
-
Zeroth Order Non-convex optimization with Dueling-Choice Bandits
We consider a novel setting of zeroth order non-convex optimization, whe...
read it
-
Active Learning for Graph Neural Networks via Node Feature Propagation
Graph Neural Networks (GNNs) for prediction tasks like node classificati...
read it
-
Thresholding Bandit Problem with Both Duels and Pulls
The Thresholding Bandit Problem (TBP) aims to find the set of arms with ...
read it
-
Efficient Load Sampling for Worst-Case Structural Analysis Under Force Location Uncertainty
An important task in structural design is to quantify the structural per...
read it
-
Gradient Descent Provably Optimizes Over-parameterized Neural Networks
One of the mystery in the success of neural networks is randomly initial...
read it
-
PeerReview4All: Fair and Accurate Reviewer Assignment in Peer Review
We consider the problem of automated assignment of papers to reviewers i...
read it
-
Nonparametric Regression with Comparisons: Escaping the Curse of Dimensionality with Ordinal Information
In supervised learning, we leverage a labeled dataset to design methods ...
read it
-
Robust Nonparametric Regression under Huber's ε-contamination Model
We consider the non-parametric regression problem under Huber's ϵ-contam...
read it
-
How Many Samples are Needed to Learn a Convolutional Neural Network?
A widespread folklore for explaining the success of convolutional neural...
read it
-
Local White Matter Architecture Defines Functional Brain Dynamics
Large bundles of myelinated axons, called white matter, anatomically con...
read it
-
Optimization of Smooth Functions with Noisy Observations: Local Minimax Rates
We consider the problem of global optimization of an unknown non-convex ...
read it
-
Towards Understanding the Generalization Bias of Two Layer Convolutional Linear Classifiers with Gradient Descent
A major challenge in understanding the generalization of deep learning i...
read it
-
Gradient Descent Learns One-hidden-layer CNN: Don't be Afraid of Spurious Local Minima
We consider the problem of learning a one-hidden-layer neural network wi...
read it
-
Near-Optimal Discrete Optimization for Experimental Design: A Regret Minimization Approach
The experimental design problem concerns the selection of k points from ...
read it
-
Stochastic Zeroth-order Optimization in High Dimensions
We consider the problem of optimizing a high-dimensional convex function...
read it
-
Gradient Descent Can Take Exponential Time to Escape Saddle Points
Although gradient descent (GD) almost always escapes saddle points asymp...
read it
-
Noise-Tolerant Interactive Learning from Pairwise Comparisons
We study the problem of interactively learning a binary classifier using...
read it
-
Computationally Efficient Robust Estimation of Sparse Functionals
Many conventional statistical procedures are extremely sensitive to seem...
read it
-
On the Power of Truncated SVD for General High-rank Matrix Estimation Problems
We show that given an estimate A that is close to a general high-rank po...
read it
-
Rate Optimal Estimation and Confidence Intervals for High-dimensional Regression with Missing Covariates
Although a majority of the theoretical literature in high-dimensional st...
read it
-
A Theoretical Analysis of Noisy Sparse Subspace Clustering on Dimensionality-Reduced Data
Subspace clustering is the problem of partitioning unlabeled data points...
read it
-
Classification Accuracy as a Proxy for Two Sample Testing
When data analysts train a classifier and check if its accuracy is signi...
read it
-
Active Learning Algorithms for Graphical Model Selection
The problem of learning the structure of a high dimensional graphical mo...
read it
-
Minimax Lower Bounds for Linear Independence Testing
Linear independence testing is a fundamental information-theoretic and s...
read it
-
On Computationally Tractable Selection of Experiments in Measurement-Constrained Regression Models
We derive computationally tractable methods to select a small subset of ...
read it
-
Signal Representations on Graphs: Tools and Applications
We present a framework for representing and modeling data on graphs. Bas...
read it
-
Adaptivity and Computation-Statistics Tradeoffs for Kernel and Distance based High Dimensional Two Sample Testing
Nonparametric two sample testing is a decision theoretic problem that in...
read it
-
Extreme Compressive Sampling for Covariance Estimation
This paper studies the problem of estimating the covariance of a collect...
read it
-
Provably Correct Algorithms for Matrix Column Subset Selection with Selectively Sampled Data
We consider the problem of matrix column subset selection, which selects...
read it
-
An Analysis of Active Learning With Uniform Feature Noise
In active learning, the user sequentially chooses values for feature X a...
read it
-
Algorithmic Connections Between Active Learning and Stochastic Convex Optimization
Interesting theoretical associations have been established by recent pap...
read it
-
Risk Bounds For Mode Clustering
Density mode clustering is a nonparametric clustering method. The cluste...
read it
-
Signal Recovery on Graphs: Random versus Experimentally Designed Sampling
We study signal recovery on graphs based on two sampling strategies: ran...
read it
-
Graph Connectivity in Noisy Sparse Subspace Clustering
Subspace clustering is the problem of clustering data points into a unio...
read it
-
On the High-dimensional Power of Linear-time Kernel Two-Sample Testing under Mean-difference Alternatives
Nonparametric two sample testing deals with the question of consistently...
read it
-
On the Power of Adaptivity in Matrix Completion and Approximation
We consider the related tasks of matrix completion and matrix approximat...
read it
-
Noise-adaptive Margin-based Active Learning and Lower Bounds under Tsybakov Noise Condition
We present a simple noise-robust margin-based active learning algorithm ...
read it
-
Subspace Learning from Extremely Compressed Measurements
We consider learning the principal subspace of a large set of vectors fr...
read it
-
Near-optimal Anomaly Detection in Graphs using Lovasz Extended Scan Statistic
The detection of anomalous activity in graphs is a statistical problem t...
read it
-
Tight Lower Bounds for Homology Inference
The homology groups of a manifold are important topological invariants t...
read it
-
Cluster Trees on Manifolds
In this paper we investigate the problem of estimating the cluster tree ...
read it
-
Minimax Theory for High-dimensional Gaussian Mixtures with Sparse Mean Separation
While several papers have investigated computationally and statistically...
read it