Adam Tauman Kalai

According to our database1, Adam Tauman Kalai authored at least 70 papers between 1997 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2019
Bias in Bios: A Case Study of Semantic Representation Bias in a High-Stakes Setting.
Proceedings of the Conference on Fairness, Accountability, and Transparency, 2019

Generalize Across Tasks: Efficient Algorithms for Linear Representation Learning.
Proceedings of the Algorithmic Learning Theory, 2019

2018
Usability of Humanly Computable Passwords.
Proceedings of the Sixth AAAI Conference on Human Computation and Crowdsourcing, 2018

Decoupled Classifiers for Group-Fair and Efficient Machine Learning.
Proceedings of the Conference on Fairness, Accountability and Transparency, 2018

Actively Avoiding Nonsense in Generative Models.
Proceedings of the Conference On Learning Theory, 2018

Unleashing Linear Optimizers for Group-Fair Learning and Optimization.
Proceedings of the Conference On Learning Theory, 2018

Glass-Box Program Synthesis: A Machine Learning Approach.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

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

Beyond Bilingual: Multi-sense Word Embeddings using Multilingual Context.
Proceedings of the 2nd Workshop on Representation Learning for NLP, 2017

Counterfactual Language Model Adaptation for Suggesting Phrases.
Proceedings of the Eighth International Joint Conference on Natural Language Processing, 2017

Learning to Suggest Phrases.
Proceedings of the Workshops of the The Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016
Reading and Learning Smartfonts.
Proceedings of the 29th Annual Symposium on User Interface Software and Technology, 2016

On Suggesting Phrases vs. Predicting Words for Mobile Text Composition.
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.
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.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

OMG UR Funny! Computer-Aided Humor with an Application to Chat.
Proceedings of the Sixth International Conference on Computational Creativity, Park City, Utah, USA, June 29, 2015

Crowdsourcing Feature Discovery via Adaptively Chosen Comparisons.
Proceedings of the Third AAAI Conference on Human Computation and Crowdsourcing, 2015

2014
A Crowd of Your Own: Crowdsourcing for On-Demand Personalization.
Proceedings of the Seconf AAAI Conference on Human Computation and Crowdsourcing, 2014

2013
A colorful approach to text processing by example.
Proceedings of the 26th Annual ACM Symposium on User Interface Software and Technology, 2013

Feature Multi-Selection among Subjective Features.
Proceedings of the 30th International Conference on Machine Learning, 2013

A Machine Learning Framework for Programming by Example.
Proceedings of the 30th International Conference on Machine Learning, 2013

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

2012
Disentangling Gaussians.
Commun. ACM, 2012

2011
Cooperation in two person games, revisited.
SIGecom Exchanges, 2011

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

Efficient Learning of Generalized Linear and Single Index Models with Isotonic Regression.
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.
Proceedings of the Innovations in Computer Science, 2011

Adaptively Learning the Crowd Kernel.
Proceedings of the 28th International Conference on Machine Learning, 2011

2010
A commitment folk theorem.
Games and Economic Behavior, 2010

A Novel Approach to Propagating Distrust.
Proceedings of the Internet and Network Economics - 6th International Workshop, 2010

Efficiently learning mixtures of two Gaussians.
Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010

On the Equilibria of Alternating Move Games.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Cooperation and competition in strategic games with private information.
Proceedings of the Proceedings 11th ACM Conference on Electronic Commerce (EC-2010), 2010

Tight asymptotic bounds for the deletion channel with small deletion probabilities.
Proceedings of the IEEE International Symposium on Information Theory, 2010

Playing Games without Observing Payoffs.
Proceedings of the Innovations in Computer Science, 2010

2009
Potential-Based Agnostic Boosting.
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.
Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009

The Isotron Algorithm: High-Dimensional Isotonic Regression.
Proceedings of the COLT 2009, 2009

Reliable Agnostic Learning.
Proceedings of the COLT 2009, 2009

2008
Trust-based recommendation systems: an axiomatic approach.
Proceedings of the 17th International Conference on World Wide Web, 2008

On agnostic boosting and parity learning.
Proceedings of the 40th Annual ACM Symposium on Theory of Computing, 2008

Agnostically learning decision trees.
Proceedings of the 40th Annual ACM Symposium on Theory of Computing, 2008

The myth of the folk theorem.
Proceedings of the 40th Annual ACM Symposium on Theory of Computing, 2008

A Query Algorithm for Agnostically Learning DNF?.
Proceedings of the 21st Annual Conference on Learning Theory, 2008

2007
Playing games with approximation algorithms.
Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

Learning Nested Halfspaces and Uphill Decision Trees.
Proceedings of the Learning Theory, 20th Annual Conference on Learning Theory, 2007

2006
Simulated Annealing for Convex Optimization.
Math. Oper. Res., 2006

An Approach to Bounded Rationality.
Proceedings of the Advances in Neural Information Processing Systems 19, 2006

Graph model selection using maximum likelihood.
Proceedings of the Machine Learning, 2006

Logarithmic Regret Algorithms for Online Convex Optimization.
Proceedings of the Learning Theory, 19th Annual Conference on Learning Theory, 2006

2005
Online convex optimization in the bandit setting: gradient descent without a gradient.
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

From Batch to Transductive Online Learning.
Proceedings of the Advances in Neural Information Processing Systems 18 [Neural Information Processing Systems, 2005

Agnostically Learning Halfspaces.
Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 2005

Analysis of Perceptron-Based Active Learning.
Proceedings of the Learning Theory, 18th Annual Conference on Learning Theory, 2005

2004
Learning Monotonic Linear Functions.
Proceedings of the Learning Theory, 17th Annual Conference on Learning Theory, 2004

2003
Boosting in the presence of noise.
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003

Efficient Algorithms for Online Decision Problems.
Proceedings of the Computational Learning Theory and Kernel Machines, 2003

2002
Omnivergent Stereo.
International Journal of Computer Vision, 2002

Efficient pattern-matching with don't cares.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Generating random factored numbers, easily.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Static optimality and dynamic search-optimality in lists and trees.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

2001
Admission Control to Minimize Rejections.
Proceedings of the Algorithms and Data Structures, 7th International Workshop, 2001

2000
Noise-tolerant learning, the parity problem, and the statistical query model.
Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

Efficient Algorithms for Universal Portfolios.
Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000

1999
Omnivergent Stereo.
ICCV, 1999

On-line algorithms for combining language models.
Proceedings of the 1999 IEEE International Conference on Acoustics, 1999

Finely-Competitive Paging.
Proceedings of the 40th Annual Symposium on Foundations of Computer Science, 1999

Beating the Hold-Out: Bounds for K-fold and Progressive Cross-Validation.
Proceedings of the Twelfth Annual Conference on Computational Learning Theory, 1999

1998
A Note on Learning from Multiple-Instance Examples.
Machine Learning, 1998

1997
Universal Portfolios With and Without Transaction Costs.
Proceedings of the Tenth Annual Conference on Computational Learning Theory, 1997


  Loading...