Adam Tauman Kalai

Elad Hazan

CoRR, 2022

Using Large Language Models to Simulate Multiple Humans.

[BibT_eX]

[DOI]

Gati Aher

Rosa I. Arriaga

CoRR, 2022

Why GANs are overkill for NLP.

[BibT_eX]

[DOI]

David Alvarez-Melis

CoRR, 2022

Recurrent Convolutional Neural Networks Learn Succinct Learning Algorithms.

[BibT_eX]

[DOI]

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

Are GANs overkill for NLP?

[BibT_eX]

[DOI]

David Alvarez-Melis

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

Omnipredictors.

[BibT_eX]

[DOI]

Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

2021

Towards optimally abstaining from prediction.

[BibT_eX]

[DOI]

CoRR, 2021

Programming Puzzles.

[BibT_eX]

[DOI]

Proceedings of the Neural Information Processing Systems Track on Datasets and Benchmarks 1, 2021

Towards optimally abstaining from prediction with OOD test examples.

[BibT_eX]

[DOI]

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

Efficient Learning with Arbitrary Covariate Shift.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning Theory, 2021

Learn to Expect the Unexpected: Probably Approximately Correct Domain Generalization.

[BibT_eX]

[DOI]

Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

2020

Beyond Perturbations: Learning Guarantees with Arbitrary Adversarial Test Examples.

[BibT_eX]

[DOI]

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

HAI-GEN 2020: Workshop on Human-AI Co-Creation with Generative Models.

[BibT_eX]

[DOI]

Proceedings of the IUI '20: 25th International Conference on Intelligent User Interfaces, 2020

Identifying unpredictable test examples with worst-case guarantees.

[BibT_eX]

[DOI]

Proceedings of the Information Theory and Applications Workshop, 2020

The disparate equilibria of algorithmic decision making when individuals invest rationally.

[BibT_eX]

[DOI]

Proceedings of the FAT* '20: Conference on Fairness, 2020

2019

What's in a Name? Reducing Bias in Bios without Access to Protected Attributes.

[BibT_eX]

[DOI]

Alexandra Chouldechova

Sahin Cem Geyik

Krishnaram Kenthapadi

Anna Rumshisky

Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, 2019

Humor in Word Embeddings: Cockamamie Gobbledegook for Nincompoops.

[BibT_eX]

[DOI]

Proceedings of the 36th International Conference on Machine Learning, 2019

Bias in Bios: A Case Study of Semantic Representation Bias in a High-Stakes Setting.

[BibT_eX]

[DOI]

Alexandra Chouldechova

Sahin Cem Geyik

Krishnaram Kenthapadi

Proceedings of the Conference on Fairness, Accountability, and Transparency, 2019

Learning to Prune: Speeding up Repeated Computations.

[BibT_eX]

[DOI]

Proceedings of the Conference on Learning Theory, 2019

Generalize Across Tasks: Efficient Algorithms for Linear Representation Learning.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning Theory, 2019

What are the Biases in My Word Embedding?

[BibT_eX]

[DOI]

Nathaniel Swinger

Maria De-Arteaga

Neil Thomas Heffernan IV

Mark D. M. Leiserson

Proceedings of the 2019 AAAI/ACM Conference on AI, Ethics, and Society, 2019

Algorithmic Greenlining: An Approach to Increase Diversity.

[BibT_eX]

[DOI]

Proceedings of the 2019 AAAI/ACM Conference on AI, Ethics, and Society, 2019

2018

When optimizing nonlinear objectives is no harder than linear objectives.

[BibT_eX]

[DOI]

Daniel Alabi

Nicole Immorlica

CoRR, 2018

Usability of Humanly Computable Passwords.

[BibT_eX]

[DOI]

Samira Samadi

Proceedings of the Sixth AAAI Conference on Human Computation and Crowdsourcing, 2018

Decoupled Classifiers for Group-Fair and Efficient Machine Learning.

[BibT_eX]

[DOI]

Proceedings of the Conference on Fairness, Accountability and Transparency, 2018

Actively Avoiding Nonsense in Generative Models.

[BibT_eX]

[DOI]

Proceedings of the Conference On Learning Theory, 2018

Unleashing Linear Optimizers for Group-Fair Learning and Optimization.

[BibT_eX]

[DOI]

Daniel Alabi

Nicole Immorlica

Konstantina Christakopoulou

Proceedings of the Conference On Learning Theory, 2018

Glass-Box Program Synthesis: A Machine Learning Approach.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017

Supervising Unsupervised Learning.

[BibT_eX]

[DOI]

CoRR, 2017

Decoupled classifiers for fair and efficient machine learning.

[BibT_eX]

[DOI]

CoRR, 2017

Designing and Evaluating Livefonts.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual ACM Symposium on User Interface Software and Technology, 2017

Beyond Bilingual: Multi-sense Word Embeddings using Multilingual Context.

[BibT_eX]

[DOI]

Proceedings of the 2nd Workshop on Representation Learning for NLP, 2017

Counterfactual Language Model Adaptation for Suggesting Phrases.

[BibT_eX]

[DOI]

Kenneth C. Arnold

Kai-Wei Chang

Proceedings of the Eighth International Joint Conference on Natural Language Processing, 2017

Learning to Suggest Phrases.

[BibT_eX]

[DOI]

Kenneth Charles Arnold

Kai-Wei Chang

Proceedings of the Workshops of the The Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016

Meta-Unsupervised-Learning: A supervised approach to unsupervised learning.

[BibT_eX]

[DOI]

CoRR, 2016

Quantifying and Reducing Stereotypes in Word Embeddings.

[BibT_eX]

[DOI]

CoRR, 2016

Reading and Learning Smartfonts.

[BibT_eX]

[DOI]

Danielle Bragg

Shiri Azenkot

Proceedings of the 29th Annual Symposium on User Interface Software and Technology, 2016

On Suggesting Phrases vs. Predicting Words for Mobile Text Composition.

[BibT_eX]

[DOI]

Kenneth C. Arnold

Krzysztof Z. Gajos

Proceedings of the 29th Annual Symposium on User Interface Software and Technology, 2016

Man is to Computer Programmer as Woman is to Homemaker? Debiasing Word Embeddings.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

2015

Matching and Grokking: Approaches to Personalized Crowdsourcing.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

OMG UR Funny! Computer-Aided Humor with an Application to Chat.

[BibT_eX]

[DOI]

Proceedings of the Sixth International Conference on Computational Creativity, 2015

Crowdsourcing Feature Discovery via Adaptively Chosen Comparisons.

[BibT_eX]

[DOI]

James Y. Zou

Kamalika Chaudhuri

Proceedings of the Third AAAI Conference on Human Computation and Crowdsourcing, 2015

2014

A Crowd of Your Own: Crowdsourcing for On-Demand Personalization.

[BibT_eX]

[DOI]

Proceedings of the Seconf AAAI Conference on Human Computation and Crowdsourcing, 2014

2013

A colorful approach to text processing by example.

[BibT_eX]

[DOI]

Proceedings of the 26th Annual ACM Symposium on User Interface Software and Technology, 2013

Feature Multi-Selection among Subjective Features.

[BibT_eX]

[DOI]

Sivan Sabato

Proceedings of the 30th International Conference on Machine Learning, 2013

A Machine Learning Framework for Programming by Example.

[BibT_eX]

[DOI]

Proceedings of the 30th International Conference on Machine Learning, 2013

Personalized Human Computation.

[BibT_eX]

[DOI]

Proceedings of the Human Computation and Crowdsourcing: Works in Progress and Demonstration Abstracts, 2013

2012

Reliable agnostic learning.

[BibT_eX]

[DOI]

Yishay Mansour

J. Comput. Syst. Sci., 2012

Textual Features for Programming by Example

[BibT_eX]

[DOI]

CoRR, 2012

Disentangling Gaussians.

[BibT_eX]

[DOI]

Ankur Moitra

Gregory Valiant

Commun. ACM, 2012

2011

Cooperation in two person games, revisited.

[BibT_eX]

[DOI]

Ehud Kalai

SIGecom Exch., 2011

Dueling algorithms.

[BibT_eX]

[DOI]

Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011

Efficient Learning of Generalized Linear and Single Index Models with Isotonic Regression.

[BibT_eX]

[DOI]

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

Compression without a common prior: an information-theoretic justification for ambiguity in language.

[BibT_eX]

[DOI]

Proceedings of the Innovations in Computer Science, 2011

Adaptively Learning the Crowd Kernel.

[BibT_eX]

[DOI]

Proceedings of the 28th International Conference on Machine Learning, 2011

2010

A commitment folk theorem.

[BibT_eX]

[DOI]

Games Econ. Behav., 2010

A Novel Approach to Propagating Distrust.

[BibT_eX]

[DOI]

Proceedings of the Internet and Network Economics - 6th International Workshop, 2010

Efficiently learning mixtures of two Gaussians.

[BibT_eX]

[DOI]

Ankur Moitra

Gregory Valiant

Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010

On the Equilibria of Alternating Move Games.

[BibT_eX]

[DOI]

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Cooperation and competition in strategic games with private information.

[BibT_eX]

[DOI]

Ehud Kalai

Proceedings of the Proceedings 11th ACM Conference on Electronic Commerce (EC-2010), 2010

Tight asymptotic bounds for the deletion channel with small deletion probabilities.

[BibT_eX]

[DOI]

Michael Mitzenmacher

Madhu Sudan

Proceedings of the IEEE International Symposium on Information Theory, 2010

Playing Games without Observing Payoffs.

[BibT_eX]

[DOI]

Michal Feldman

Moshe Tennenholtz

Proceedings of the Innovations in Computer Science, 2010

2009

Playing Games with Approximation Algorithms.

[BibT_eX]

[DOI]

Sham M. Kakade

Katrina Ligett

SIAM J. Comput., 2009

Analysis of Perceptron-Based Active Learning.

[BibT_eX]

[DOI]

Sanjoy Dasgupta

Claire Monteleoni

J. Mach. Learn. Res., 2009

Potential-Based Agnostic Boosting.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 22: 23rd Annual Conference on Neural Information Processing Systems 2009. Proceedings of a meeting held 7-10 December 2009, 2009

Learning and Smoothed Analysis.

[BibT_eX]

[DOI]

Alex Samorodnitsky

Shang-Hua Teng

Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009

The Isotron Algorithm: High-Dimensional Isotonic Regression.

[BibT_eX]

[DOI]

Ravi Sastry

Proceedings of the COLT 2009, 2009

2008

Agnostically Learning Halfspaces.

[BibT_eX]

[DOI]

SIAM J. Comput., 2008

Decision trees are PAC-learnable from most product distributions: a smoothed analysis

[BibT_eX]

[DOI]

Shang-Hua Teng

CoRR, 2008

Trust-based recommendation systems: an axiomatic approach.

[BibT_eX]

[DOI]

Proceedings of the 17th International Conference on World Wide Web, 2008

On agnostic boosting and parity learning.

[BibT_eX]

[DOI]

Yishay Mansour

Elad Verbin

Proceedings of the 40th Annual ACM Symposium on Theory of Computing, 2008

Agnostically learning decision trees.

[BibT_eX]

[DOI]

Parikshit Gopalan

Adam R. Klivans

Proceedings of the 40th Annual ACM Symposium on Theory of Computing, 2008

A Query Algorithm for Agnostically Learning DNF?.

[BibT_eX]

[DOI]

Parikshit Gopalan

Christos H. Papadimitriou

Adam R. Klivans

Proceedings of the 21st Annual Conference on Learning Theory, 2008

2007

The Myth of the Folk Theorem.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2007

Learning Nested Halfspaces and Uphill Decision Trees.

[BibT_eX]

[DOI]

Proceedings of the Learning Theory, 20th Annual Conference on Learning Theory, 2007

2006

Simulated Annealing for Convex Optimization.

[BibT_eX]

[DOI]

Math. Oper. Res., 2006

An Approach to Bounded Rationality.

[BibT_eX]

[DOI]

Eli Ben-Sasson

Ehud Kalai

Proceedings of the Advances in Neural Information Processing Systems 19, 2006

Graph model selection using maximum likelihood.

[BibT_eX]

[DOI]

Ivona Bezáková

Rahul Santhanam

Proceedings of the Machine Learning, 2006

Logarithmic Regret Algorithms for Online Convex Optimization.

[BibT_eX]

[DOI]

Proceedings of the Learning Theory, 19th Annual Conference on Learning Theory, 2006

2005

Efficient algorithms for online decision problems.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2005

Boosting in the presence of noise.

[BibT_eX]

[DOI]

Rocco A. Servedio

J. Comput. Syst. Sci., 2005

Online convex optimization in the bandit setting: gradient descent without a gradient.

[BibT_eX]

[DOI]

Abraham Flaxman

H. Brendan McMahan

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

From Batch to Transductive Online Learning.

[BibT_eX]

[DOI]

Sham M. Kakade

Proceedings of the Advances in Neural Information Processing Systems 18 [Neural Information Processing Systems, 2005

2004

Learning Monotonic Linear Functions.

[BibT_eX]

[DOI]

Proceedings of the Learning Theory, 17th Annual Conference on Learning Theory, 2004

2003

Generating Random Factored Numbers, Easily.

[BibT_eX]

[DOI]

J. Cryptol., 2003

Noise-tolerant learning, the parity problem, and the statistical query model.

[BibT_eX]

[DOI]

Hal Wasserman

J. ACM, 2003

Admission Control to Minimize Rejections.

[BibT_eX]

[DOI]

Jon M. Kleinberg

Internet Math., 2003

Static Optimality and Dynamic Search-Optimality in Lists and Trees.

[BibT_eX]

[DOI]

Shuchi Chawla

Algorithmica, 2003

2002

Efficient Algorithms for Universal Portfolios.

[BibT_eX]

[DOI]

J. Mach. Learn. Res., 2002

Omnivergent Stereo.

[BibT_eX]

[DOI]

Steven M. Seitz

Heung-Yeung Shum

Int. J. Comput. Vis., 2002

Efficient pattern-matching with don't cares.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

1999

Universal Portfolios With and Without Transaction Costs.

[BibT_eX]

[DOI]

Mach. Learn., 1999

On-line algorithms for combining language models.

[BibT_eX]

[DOI]

Proceedings of the 1999 IEEE International Conference on Acoustics, 1999

Finely-Competitive Paging.

[BibT_eX]

[DOI]

Carl Burch

Proceedings of the 40th Annual Symposium on Foundations of Computer Science, 1999

Beating the Hold-Out: Bounds for K-fold and Progressive Cross-Validation.

[BibT_eX]

[DOI]

John Langford

Proceedings of the Twelfth Annual Conference on Computational Learning Theory, 1999

1998

A Note on Learning from Multiple-Instance Examples.

[BibT_eX]

[DOI]