beygel [ home | publications ]

Alina Beygelzimer, John Langford, and David M. Pennock. Performance of prediction markets with Kelly bettors, AAMAS-2012.

Alina Beygelzimer, John Langford, Lihong Li, Lev Reyzin, Robert E. Schapire. Contextual Bandit Algorithms with Supervised Learning Guarantees, Journal of Machine Learning Research---Proceedings Track 15: 19--26, 2011: Proceedings of the 14th International Conference on Artificial Intelligence and Statistics (AISTATS 2011), notable paper award.

Alina Beygelzimer, Daniel Hsu, John Langford, and Tong Zhang. Agnostic active learning without constraints, Advances in Neural Information Processing Systems (NIPS), 2010.

Alina Beygelzimer, Sanjoy Dasgupta, and John Langford. Importance-weighted active learning, ICML-2009.

Alina Beygelzimer and John Langford. The Offset tree for learning with partial labels, KDD-2009.

Alina Beygelzimer, John Langford, and Pradeep Ravikumar. Error-correcting tournaments, ALT-2009.

Nina Balcan, Nikhil Bansal, Alina Beygelzimer, Don Coppersmith, John Langford, and Greg Sorkin. Robust reductions from ranking to classification, COLT 2007.

Nina Balcan, Alina Beygelzimer, and John Langford. Agnostic active learning (journal), the 23rd International Conference on Machine Learning (ICML), 2006.

Alina Beygelzimer, Sham Kakade, and John Langford. Cover trees for nearest neighbor, ICML-2006.

John Langford, Alina Beygelzimer. Sensitive error correcting output codes, the 18th Annual Conference on Learning Theory (COLT), 2005.

Alina Beygelzimer, John Langford, and Bianca Zadrozny. Weighted One Against All, the 20th National Conference on Artificial Intelligence (AAAI), 2005.

Alina Beygelzimer, Varsha Dani, Tom Hayes, John Langford, and Bianca Zadrozny. Error-limiting reductions between classification tasks, the 22nd International Conference on Machine Learning (ICML), 2005.

Alice Zheng, Irina Rish, and Alina Beygelzimer, Entropy approximation for active fault diagnosis, UAI 2005.

Alina Beygelzimer, Mitsunori Ogihara. The enumerability of P collapses P to NC, Theoretical Computer Science, 345, 248--259, 2005.

Alina Beygelzimer, Geoffrey Grinstein, Ralph Linsker, Irina Rish. Improving network robustness, Physica A, 357(3-4), 593--612, November 2005.

Alina Beygelzimer, Irina Rish, Approximability of probability distributions, Proceedings of the 17th Annual Conference on Neural Information Processing Systems (NIPS), 2003, Vancouver, BC.

Alina Beygelzimer. Alternative notions of approximation and space-bounded computations, Ph.D. Thesis, University of Rochester, April 2003.

Alina Beygelzimer, Mitsunori Ogihara. The (non)enumerability of the determinant and the rank. Theory of Computing Systems Journal 36(4), pp. 359-374, 2003.

Alina Beygelzimer, Stanislaw Radziszowski, On halving line arrangements, Discrete Mathematics 257 (2-3), pp. 267-283, 2002 (a special volume in honor of D.Kleitman).

Alina Beygelzimer, Irina Rish, On the treewidth and its relation to learning, Proceedings of the 8th International Conference on Principles of Knowledge Representation and Reasoning (KR-2002), Tulouse, France.

Alina Beygelzimer, Charles Perng, Sheng Ma, Fast ordering of large categorical datasets, Proceedings of the 7th ACM International Conference on Knowledge Discovery and Data Mining (KDD-2001).

Alina Beygelzimer, Lane Hemaspaandra, Christopher Homan, Jorg Rothe. One-way functions in worst-case cryptography: algebraic and security properties are on the house, SIGACT News 30(4), pp. 25-40, 1999.

[ publications | films ]