UB Paderborn / Katalog / Suche / in CDI

Algorithmic High-Dimensional Robust Statistics

2023

Volltextzugriff (PDF)

Nearly Optimal Solutions for the Chow Parameters Problem and Low-Weight Approximation of Halfspaces

Journal of the ACM, 2014-04, Vol.61 (2), p.1-36

2014

Volltextzugriff (PDF)

A New Approach for Testing Properties of Discrete Distributions

2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS), 2016, p.685-694

2016

Volltextzugriff (PDF)

List-decodable robust mean estimation and learning mixtures of spherical gaussians

Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018, p.1047-1060

2018

Volltextzugriff (PDF)

Robust Estimators in High-Dimensions Without the Computational Intractability

SIAM journal on computing, 2019-01, Vol.48 (2), p.742-864

2019

Volltextzugriff (PDF)

Small Covers for Near-Zero Sets of Polynomials and Learning Latent Variable Models

2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), 2020, p.184-195

2020

Volltextzugriff (PDF)

Learning geometric concepts with nasty noise

Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018, p.1061-1073

2018

Volltextzugriff (PDF)

Testing Bayesian Networks

IEEE transactions on information theory, 2020-05, Vol.66 (5), p.3132-3170

2020

Volltextzugriff (PDF)

Small Approximate Pareto Sets for Biobjective Shortest Paths and Other Problems

SIAM journal on computing, 2009-01, Vol.39 (4), p.1340-1371

2009

Volltextzugriff (PDF)

How Good is the Chord Algorithm?

SIAM journal on computing, 2016-01, Vol.45 (3), p.811-858

2016

Volltextzugriff (PDF)

Learning Poisson Binomial Distributions

Algorithmica, 2015-05, Vol.72 (1), p.316-357

2015

Volltextzugriff (PDF)

The Inverse Shapley value problem

Games and economic behavior, 2017-09, Vol.105, p.122-147

2017

Volltextzugriff (PDF)

A Robust Khintchine Inequality, and Algorithms for Computing Optimal Constants in Fourier Analysis and High-Dimensional Geometry

SIAM journal on discrete mathematics, 2016-01, Vol.30 (2), p.1058-1094

2016

Volltextzugriff (PDF)

A Strongly Polynomial Algorithm for Approximate Forster Transforms and Its Application to Halfspace Learning

Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023, p.1741-1754

2023

Volltextzugriff (PDF)

The complexity of optimal multidimensional pricing for a unit-demand buyer

Games and economic behavior, 2018-07, Vol.110, p.139-164

2018

Volltextzugriff (PDF)

Statistical Query Lower Bounds for Robust Estimation of High-Dimensional Gaussians and Gaussian Mixtures

2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS), 2017, p.73-84

2017

Volltextzugriff (PDF)

On the Complexity of Optimal Lottery Pricing and Randomized Mechanisms for a Unit-Demand Buyer

SIAM journal on computing, 2022-01, Vol.51 (3), p.492-548

2022

Volltextzugriff (PDF)

Testing Shape Restrictions of Discrete Distributions

Theory of computing systems, 2018, Vol.62 (1), p.4-62

2018

Volltextzugriff (PDF)

Learning poisson binomial distributions

Proceedings of the forty-fourth annual ACM symposium on Theory of computing, 2012, p.709-728

2012

Volltextzugriff (PDF)

Efficient density estimation via piecewise polynomial approximation

Proceedings of the forty-sixth annual ACM symposium on Theory of computing, 2014, p.604-613

2014

Volltextzugriff (PDF)

Clustering mixture models in almost-linear time via list-decodable mean estimation

Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, 2022, p.1262-1275

2022

Volltextzugriff (PDF)

Improved Approximation of Linear Threshold Functions

Computational complexity, 2013-09, Vol.22 (3), p.623-677

2013

Volltextzugriff (PDF)

BOUNDED INDEPENDENCE FOOLS HALFSPACES

SIAM journal on computing, 2010-01, Vol.39 (7-8), p.3441-3462

2010

Volltextzugriff (PDF)

Optimal testing of discrete distributions with high probability

Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021, p.542-555

2021

Volltextzugriff (PDF)

Robustly learning mixtures of k arbitrary Gaussians

Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, 2022, p.1234-1247

2022

Volltextzugriff (PDF)

Menü

Weitere Dienste

Einstellungen

Algorithmic High-Dimensional Robust Statistics

Nearly Optimal Solutions for the Chow Parameters Problem and Low-Weight Approximation of Halfspaces

A New Approach for Testing Properties of Discrete Distributions

List-decodable robust mean estimation and learning mixtures of spherical gaussians

Robust Estimators in High-Dimensions Without the Computational Intractability

Small Covers for Near-Zero Sets of Polynomials and Learning Latent Variable Models

Learning geometric concepts with nasty noise

Testing Bayesian Networks

Small Approximate Pareto Sets for Biobjective Shortest Paths and Other Problems

How Good is the Chord Algorithm?

Learning Poisson Binomial Distributions

The Inverse Shapley value problem

A Robust Khintchine Inequality, and Algorithms for Computing Optimal Constants in Fourier Analysis and High-Dimensional Geometry

A Strongly Polynomial Algorithm for Approximate Forster Transforms and Its Application to Halfspace Learning

The complexity of optimal multidimensional pricing for a unit-demand buyer

Statistical Query Lower Bounds for Robust Estimation of High-Dimensional Gaussians and Gaussian Mixtures

On the Complexity of Optimal Lottery Pricing and Randomized Mechanisms for a Unit-Demand Buyer

Testing Shape Restrictions of Discrete Distributions

Learning poisson binomial distributions

Efficient density estimation via piecewise polynomial approximation

Clustering mixture models in almost-linear time via list-decodable mean estimation

Improved Approximation of Linear Threshold Functions

BOUNDED INDEPENDENCE FOOLS HALFSPACES

Optimal testing of discrete distributions with high probability

Robustly learning mixtures of k arbitrary Gaussians

Suchergebnisse filtern