Po-Ling Loh

Orcid: 0000-0002-6514-7834

According to our database1, Po-Ling Loh authored at least 55 papers between 2009 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Communication-Constrained Hypothesis Testing: Optimality, Robustness, and Reverse Data Processing Inequalities.
IEEE Trans. Inf. Theory, January, 2024

The Sample Complexity of Simple Binary Hypothesis Testing.
CoRR, 2024

2023
Robust empirical risk minimization via Newton's method.
CoRR, 2023

On the Gibbs Exponential Mechanism and Private Synthetic Data Generation.
Proceedings of the IEEE International Symposium on Information Theory, 2023

Simple Binary Hypothesis Testing under Local Differential Privacy and Communication Constraints.
Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

2022
On the identifiability of mixtures of ranking models.
CoRR, 2022

Simple Binary Hypothesis Testing under Communication Constraints.
Proceedings of the IEEE International Symposium on Information Theory, 2022

2021
Teaching and Learning in Uncertainty.
IEEE Trans. Inf. Theory, 2021

Provable training set debugging for linear regression.
Mach. Learn., 2021

Robustifying Deep Networks for Medical Image Segmentation.
J. Digit. Imaging, 2021

Differentially private inference via noisy optimization.
CoRR, 2021

Robust W-GAN-Based Estimation Under Wasserstein Contamination.
CoRR, 2021

2020
Editorial.
IEEE J. Sel. Areas Inf. Theory, 2020

Extracting Robust and Accurate Features via a Robust Information Bottleneck.
IEEE J. Sel. Areas Inf. Theory, 2020

Robust regression with covariate filtering: Heavy tails and adversarial contamination.
CoRR, 2020

Theory of Machine Learning Debugging via M-estimation.
CoRR, 2020

Boosting Algorithms for Estimating Optimal Individualized Treatment Rules.
CoRR, 2020

Conquering the Worst Case of Infections in Networks.
IEEE Access, 2020

2019
Introduction to the special issue for the ECML PKDD 2019 journal track.
Data Min. Knowl. Discov., 2019

Robustifying deep networks for image segmentation.
CoRR, 2019

Estimating location parameters in entangled single-sample distributions.
CoRR, 2019

Mean estimation for entangled single-sample distributions.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Adversarial Influence Maximization.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Does Data Augmentation Lead to Positive Margin?
Proceedings of the 36th International Conference on Machine Learning, 2019

2018
Persistence of centrality in random growing trees.
Random Struct. Algorithms, 2018

Coding Theory for Inference, Learning and Optimization (Dagstuhl Seminar 18112).
Dagstuhl Reports, 2018

Scale calibration for high-dimensional robust regression.
CoRR, 2018

Adversarial Risk Bounds for Binary Classification via Function Transformation.
CoRR, 2018

Generalization Error Bounds for Noisy, Iterative Algorithms.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Online Learning with Graph-Structured Feedback against Adaptive Adversaries.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Graph-Based Ascent Algorithms for Function Maximization.
Proceedings of the 56th Annual Allerton Conference on Communication, 2018

2017
Confidence Sets for the Source of a Diffusion in Regular Trees.
IEEE Trans. Netw. Sci. Eng., 2017

Analysis of Centrality in Sublinear Preferential Attachment Trees via the Crump-Mode-Jagers Branching Process.
IEEE Trans. Netw. Sci. Eng., 2017

On Lower Bounds for Statistical Learning Theory.
Entropy, 2017

Permutation Tests for Infection Graphs.
CoRR, 2017

Information and estimation in Fokker-Planck channels.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2016
Computationally Efficient Influence Maximization in Stochastic and Adversarial Models: Algorithms and Analysis.
CoRR, 2016

Analysis of centrality in sublinear preferential attachment trees via the CMJ branching process.
CoRR, 2016

Collection, exploration and analysis of crowdfunding social networks.
Proceedings of the Third International Workshop on Exploratory Search in Databases and the Web, 2016

Computing and maximizing influence in linear threshold and triggering models.
Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

2015
Regularized M-estimators with nonconvexity: statistical and algorithmic theory for local optima.
J. Mach. Learn. Res., 2015

Statistical consistency and asymptotic normality for high-dimensional robust M-estimators.
CoRR, 2015

Information-theoretic bounds for exact recovery in weighted stochastic block models using the Renyi divergence.
CoRR, 2015

On model misspecification and KL separation for Gaussian graphical models.
Proceedings of the IEEE International Symposium on Information Theory, 2015

Recovering communities in weighted stochastic block models.
Proceedings of the 53rd Annual Allerton Conference on Communication, 2015

2014
High-dimensional statistics with systematically corrupted data.
PhD thesis, 2014

High-dimensional learning of linear causal networks via inverse covariance estimation.
J. Mach. Learn. Res., 2014

Support recovery without incoherence: A case for nonconvex regularization.
CoRR, 2014

Concavity of reweighted Kikuchi approximation.
Proceedings of the Advances in Neural Information Processing Systems 27: Annual Conference on Neural Information Processing Systems 2014, 2014

2013
Faster Hoeffding Racing: Bernstein Races via Jackknife Estimates.
Proceedings of the Algorithmic Learning Theory - 24th International Conference, 2013

2012
The Synthesis and Analysis of Stochastic Switching Circuits
CoRR, 2012

Structure estimation for discrete graphical models: Generalized covariance matrices and their inverses.
Proceedings of the Advances in Neural Information Processing Systems 25: 26th Annual Conference on Neural Information Processing Systems 2012. Proceedings of a meeting held December 3-6, 2012

Corrupted and missing predictors: Minimax bounds for high-dimensional linear regression.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2011
High-dimensional regression with noisy and missing data: Provable guarantees with non-convexity.
Proceedings of the Advances in Neural Information Processing Systems 24: 25th Annual Conference on Neural Information Processing Systems 2011. Proceedings of a meeting held 12-14 December 2011, 2011

2009
The robustness of stochastic switching networks.
Proceedings of the IEEE International Symposium on Information Theory, 2009


  Loading...