activity
20112024
most citedHigh-dimensional regression with noisy and missing data: Provable guarantees with nonconvexity

551 citations · 1.1k across the 33 of their papers we have counts for

collaborators
Showing cs.LGShow all

6 papers · 1 filter

cs.LG2022★ 1 cited

On the identifiability of mixtures of ranking models

Xiaomin Zhang, Xucheng Zhang, Po-Ling Loh +1

Mixtures of ranking models are standard tools for ranking problems. However, even the fundamental question of parameter identifiability is not fully understood: the identifiability…

cs.LG2020

Provable Training Set Debugging for Linear Regression

Xiaomin Zhang, Xiaojin Zhu, Po-Ling Loh

We investigate problems in penalized -estimation, inspired by applications in machine learning debugging. Data are collected from two pools, one containing data with possibly co…

cs.LG2019

Extracting robust and accurate features via a robust information bottleneck

Ankit Pensia, Varun Jog, Po-Ling Loh

We propose a novel strategy for extracting features in supervised learning that can be used to construct a classifier which is more robust to small perturbations in the input space…

cs.LG2019★ 6 cited

Does Data Augmentation Lead to Positive Margin?

Shashank Rajput, Zhili Feng, Zachary Charles +2

Data augmentation (DA) is commonly used during model training, as it significantly improves test error and model robustness. DA artificially expands the training set by applying ra…

cs.LG2018★ 1 cited

Online learning with graph-structured feedback against adaptive adversaries

Zhili Feng, Po-Ling Loh

We derive upper and lower bounds for the policy regret of -round online learning problems with graph-structured feedback, where the adversary is nonoblivious but assumed to have…

cs.LG2018

Generalization Error Bounds for Noisy, Iterative Algorithms

Ankit Pensia, Varun Jog, Po-Ling Loh

In statistical learning theory, generalization error is used to quantify the degree to which a supervised machine learning algorithm may overfit to training data. Recent work [Xu a…