Christos Tzamos

Orestis Papadigenopoulos

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023

Agnostically Learning Multi-index Models with Queries.

[BibT_eX]

[DOI]

CoRR, 2023

Optimizing Solution-Samplers for Combinatorial Problems: The Landscape of Policy-Gradient Methods.

[BibT_eX]

[DOI]

Constantine Caramanis

CoRR, 2023

Buy-Many Mechanisms for Many Unit-Demand Buyers.

[BibT_eX]

[DOI]

Proceedings of the Web and Internet Economics - 19th International Conference, 2023

The Gain from Ordering in Online Learning.

[BibT_eX]

[DOI]

Mingchen Ma

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Weitzman's Rule for Pandora's Box with Correlations.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

First Order Stochastic Optimization with Oblivious Noise.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Optimizing Solution-Samplers for Combinatorial Problems: The Landscape of Policy-Gradient Method.

[BibT_eX]

[DOI]

Constantine Caramanis

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Graph Connectivity with Noisy Queries.

[BibT_eX]

[DOI]

Charilaos Pipis

Miltiadis Stouras

Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

Buying Information for Stochastic Optimization.

[BibT_eX]

[DOI]

Mingchen Ma

Proceedings of the International Conference on Machine Learning, 2023

Self-Directed Linear Classification.

[BibT_eX]

[DOI]

Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

Distribution-Independent Regression for Generalized Linear Models with Oblivious Corruptions.

[BibT_eX]

[DOI]

Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

Approximating Pandora's Box with Correlations.

[BibT_eX]

[DOI]

Jeremy McMahan

Proceedings of the Approximation, 2023

2022

Buy-many mechanisms are not much better than item pricing.

[BibT_eX]

[DOI]

Games Econ. Behav., 2022

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

[BibT_eX]

[DOI]

Daniel Kane

Electron. Colloquium Comput. Complex., 2022

Efficient Parameter Estimation of Truncated Boolean Product Distributions.

[BibT_eX]

[DOI]

Alkis Kalavasis

Algorithmica, 2022

Learning general halfspaces with general Massart noise under the Gaussian distribution.

[BibT_eX]

[DOI]

Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Pricing ordered items.

[BibT_eX]

[DOI]

Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Perfect Sampling from Pairwise Comparisons.

[BibT_eX]

[DOI]

Alkis Kalavasis

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Linear Label Ranking with Bounded Noise.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Online Learning for Min Sum Set Cover and Pandora's Box.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Machine Learning, 2022

Learning General Halfspaces with Adversarial Label Noise via Online Gradient Descent.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Machine Learning, 2022

Clustering with Queries under Semi-Random Noise.

[BibT_eX]

[DOI]

Alberto Del Pia

Mingchen Ma

Proceedings of the Conference on Learning Theory, 2-5 July 2022, London, UK., 2022

Learning a Single Neuron with Adversarial Label Noise via Gradient Descent.

[BibT_eX]

[DOI]

Proceedings of the Conference on Learning Theory, 2-5 July 2022, London, UK., 2022

2021

Combinatorial Assortment Optimization.

[BibT_eX]

[DOI]

ACM Trans. Economics and Comput., 2021

ReLU Regression with Massart Noise.

[BibT_eX]

[DOI]

Jongho Park

CoRR, 2021

Threshold Phenomena in Learning Halfspaces with Massart Noise.

[BibT_eX]

[DOI]

CoRR, 2021

Efficiently learning halfspaces with Tsybakov noise.

[BibT_eX]

[DOI]

Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

Fast and Simple Modular Subset Sum.

[BibT_eX]

[DOI]

Proceedings of the 4th Symposium on Simplicity in Algorithms, 2021

ReLU Regression with Massart Noise.

[BibT_eX]

[DOI]

Jong Ho Park

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Forster Decomposition and Learning Halfspaces with Noise.

[BibT_eX]

[DOI]

Daniel Kane

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

On Robust Mean Estimation under Coordinate-level Corruption.

[BibT_eX]

[DOI]

Proceedings of the 38th International Conference on Machine Learning, 2021

Learning Online Algorithms with Distributional Advice.

[BibT_eX]

[DOI]

Proceedings of the 38th International Conference on Machine Learning, 2021

Efficient Algorithms for Learning from Coarse Labels.

[BibT_eX]

[DOI]

Proceedings of the Conference on Learning Theory, 2021

Agnostic Proper Learning of Halfspaces under Gaussian Marginals.

[BibT_eX]

[DOI]

Proceedings of the Conference on Learning Theory, 2021

Boosting in the Presence of Massart Noise.

[BibT_eX]

[DOI]

Proceedings of the Conference on Learning Theory, 2021

A Statistical Taylor Theorem and Extrapolation of Truncated Densities.

[BibT_eX]

[DOI]

Emmanouil Zampetakis

Proceedings of the Conference on Learning Theory, 2021

2020

The Complexity of Black-Box Mechanism Design with Priors.

[BibT_eX]

[DOI]

Brendan Lucier

ACM Trans. Economics and Comput., 2020

Buy-many mechanisms: what are they and why should you care?

[BibT_eX]

[DOI]

SIGecom Exch., 2020

Convergence and Sample Complexity of SGD in GANs.

[BibT_eX]

[DOI]

Sihan Liu

CoRR, 2020

A Polynomial Time Algorithm for Learning Halfspaces with Tsybakov Noise.

[BibT_eX]

[DOI]

CoRR, 2020

Learning Halfspaces with Tsybakov Noise.

[BibT_eX]

[DOI]

CoRR, 2020

Robust Mean Estimation under Coordinate-level Corruption.

[BibT_eX]

[DOI]

CoRR, 2020

Menu-size Complexity and Revenue Continuity of Buy-many Mechanisms.

[BibT_eX]

[DOI]

Proceedings of the EC '20: The 21st ACM Conference on Economics and Computation, 2020

Optimal Private Median Estimation under Minimal Distributional Assumptions.

[BibT_eX]

[DOI]

Emmanouil V. Vlatakis-Gkaragkounis

Ilias Zadik

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Non-Convex SGD Learns Halfspaces with Adversarial Label Noise.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Black-Box Methods for Restoring Monotonicity.

[BibT_eX]

[DOI]

Brendan Lucier

Proceedings of the 37th International Conference on Machine Learning, 2020

Pandora's Box with Correlations: Learning and Approximation.

[BibT_eX]

[DOI]

Ruimin Zhang

Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

Learning Halfspaces with Massart Noise Under Structured Distributions.

[BibT_eX]

[DOI]

Proceedings of the Conference on Learning Theory, 2020

2019

Design and Dynamic Pricing of Vertically Differentiated Inventories.

[BibT_eX]

[DOI]

Ioannis Stamatopoulos

Manag. Sci., 2019

Learning Optimal Search Algorithms from Data.

[BibT_eX]

[DOI]

Ruimin Zhang

CoRR, 2019

Reasonable multi-item mechanisms are not much better than item pricing.

[BibT_eX]

[DOI]

CoRR, 2019

Diversity and Exploration in Social Learning.

[BibT_eX]

[DOI]

Nicole Immorlica

Jieming Mao

Proceedings of the World Wide Web Conference, 2019

Fast Modular Subset Sum using Linear Sketching.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Distribution-Independent PAC Learning of Halfspaces with Massart Noise.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Capacitated Dynamic Programming: Faster Knapsack and Graph Algorithms.

[BibT_eX]

[DOI]

Kyriakos Axiotis

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

Efficient Truncated Statistics with Unknown Truncation.

[BibT_eX]

[DOI]

Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

Computationally and Statistically Efficient Truncated Regression.

[BibT_eX]

[DOI]

Proceedings of the Conference on Learning Theory, 2019

Learning to Prune: Speeding up Repeated Computations.

[BibT_eX]

[DOI]

Proceedings of the Conference on Learning Theory, 2019

2018

Anaconda: A Non-Adaptive Conditional Sampling Algorithm for Distribution Testing.

[BibT_eX]

[DOI]

Gautam Kamath

Electron. Colloquium Comput. Complex., 2018

Fast Modular Subset Sum using Linear Sketching.

[BibT_eX]

[DOI]

Kyriakos Axiotis

Arturs Backurs

CoRR, 2018

A converse to Banach's fixed point theorem and its CLS-completeness.

[BibT_eX]

[DOI]

Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

Efficient Statistics, in High Dimensions, from Truncated Samples.

[BibT_eX]

[DOI]

Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018

Actively Avoiding Nonsense in Generative Models.

[BibT_eX]

[DOI]

Proceedings of the Conference On Learning Theory, 2018

Certified Computation from Unreliable Datasets.

[BibT_eX]

[DOI]

Proceedings of the Conference On Learning Theory, 2018

Bootstrapping EM via Power EM and Convergence in the Naive Bayes Model.

[BibT_eX]

[DOI]

Costis Daskalakis

Proceedings of the International Conference on Artificial Intelligence and Statistics, 2018

2017

Mechanism design: from optimal transport theory to revenue maximization.

[BibT_eX]

[DOI]

PhD thesis, 2017

Certified Computation in Crowdsourcing.

[BibT_eX]

[DOI]

CoRR, 2017

Truthful Facility Location with Additive Errors.

[BibT_eX]

[DOI]

Iddan Golomb

CoRR, 2017

Faster Sublinear Algorithms using Conditional Sampling.

[BibT_eX]

[DOI]

Themistoklis Gouleakis

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Improving Viterbi is Hard: Better Runtimes Imply Faster Clique Algorithms.

[BibT_eX]

[DOI]

Arturs Backurs

Proceedings of the 34th International Conference on Machine Learning, 2017

Ten Steps of EM Suffice for Mixtures of Two Gaussians.

[BibT_eX]

[DOI]

Proceedings of the 30th Conference on Learning Theory, 2017

2016

Efficient Money Burning in General Domains.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2016

Strategyproof Facility Location for Concave Cost Functions.

[BibT_eX]

[DOI]

Algorithmica, 2016

Anonymous Auctions Maximizing Revenue.

[BibT_eX]

[DOI]

Christopher A. Wilkens

Proceedings of the Web and Internet Economics - 12th International Conference, 2016

A size-free CLT for poisson multinomials and its applications.

[BibT_eX]

[DOI]

Anindya De

Gautam Kamath

Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016

Mechanism Design with Selective Verification.

[BibT_eX]

[DOI]

Proceedings of the 2016 ACM Conference on Economics and Computation, 2016

Does Information Revelation Improve Revenue?

[BibT_eX]

[DOI]

Christos H. Papadimitriou

Proceedings of the 2016 ACM Conference on Economics and Computation, 2016

Tight Hardness Results for Maximum Weight Rectangles.

[BibT_eX]

[DOI]

Arturs Backurs

Nishanth Dikkala

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2015

Who to Trust for Truthfully Maximizing Welfare?

[BibT_eX]

[DOI]

Emmanouil Zampetakis

CoRR, 2015

Strong Duality for a Multiple-Good Monopolist.

[BibT_eX]

[DOI]

Proceedings of the Sixteenth ACM Conference on Economics and Computation, 2015

Game Theory based Peer Grading Mechanisms for MOOCs.

[BibT_eX]

[DOI]

William Wu

Nicolaas Kaashoek

S. Matthew Weinberg

Proceedings of the Second ACM Conference on Learning @ Scale, 2015

On the Structure, Covering, and Learning of Poisson Multinomial Distributions.

[BibT_eX]

[DOI]

Gautam Kamath

Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

2014

On the Power of Deterministic Mechanisms for Facility Location Games.

[BibT_eX]

[DOI]

ACM Trans. Economics and Comput., 2014

The Value of Knowing Your Enemy.

[BibT_eX]

[DOI]

Christopher A. Wilkens

CoRR, 2014

The Complexity of Optimal Mechanism Design.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

2013

Winner-imposing strategyproof mechanisms for multiple Facility Location games.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Strategyproof facility location with concave costs.

[BibT_eX]

[DOI]

SIGecom Exch., 2013

Strategy-Proof Facility Location for Concave Cost Functions

[BibT_eX]

[DOI]

CoRR, 2013

Mechanism design via optimal transport.

[BibT_eX]

[DOI]

Proceedings of the fourteenth ACM Conference on Electronic Commerce, 2013

2012

Optimal Pricing Is Hard.

[BibT_eX]

[DOI]