# Alina Beygelzimer

According to our database1, Alina Beygelzimer authored at least 47 papers between 1999 and 2020.

Collaborative distances:

Book
In proceedings
Article
PhD thesis
Other

## Bibliography

2020
Improving Reproducibility in Machine Learning Research (A Report from the NeurIPS 2019 Reproducibility Program).
CoRR, 2020

2019
Contextual Memory Trees.
Proceedings of the 36th International Conference on Machine Learning, 2019

Bandit Multiclass Linear Classification: Efficient Algorithms for the Separable Case.
Proceedings of the 36th International Conference on Machine Learning, 2019

2018
A Reductions Approach to Fair Classification.
Proceedings of the 35th International Conference on Machine Learning, 2018

2017
Efficient Online Bandit Multiclass Learning with $\tilde{O}(\sqrt{T})$ Regret.
CoRR, 2017

Efficient Online Bandit Multiclass Learning with Õ(√T) Regret.
Proceedings of the 34th International Conference on Machine Learning, 2017

2016
Learning Reductions That Really Work.
Proceedings of the IEEE, 2016

Search Improves Label for Active Learning.
Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

2015
Proceedings of the Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, 2015

Optimal and Adaptive Algorithms for Online Boosting.
Proceedings of the 32nd International Conference on Machine Learning, 2015

2014
Scalable Nonlinear Learning with Adaptive Polynomial Expansions.
CoRR, 2014

Scalable Non-linear Learning with Adaptive Polynomial Expansions.
Proceedings of the Advances in Neural Information Processing Systems 27: Annual Conference on Neural Information Processing Systems 2014, 2014

2013
Big Data Exploration Via Automated Orchestration of Analytic Workflows.
Proceedings of the 10th International Conference on Autonomic Computing, 2013

2012
Learning performance of prediction markets with Kelly bettors.
Proceedings of the International Conference on Autonomous Agents and Multiagent Systems, 2012

2011
Contextual Bandit Algorithms with Supervised Learning Guarantees.
Proceedings of the Fourteenth International Conference on Artificial Intelligence and Statistics, 2011

2010
An Optimal High Probability Algorithm for the Contextual Bandit Problem
CoRR, 2010

Agnostic Active Learning Without Constraints.
Proceedings of the Advances in Neural Information Processing Systems 23: 24th Annual Conference on Neural Information Processing Systems 2010. Proceedings of a meeting held 6-9 December 2010, 2010

2009
Agnostic active learning.
J. Comput. Syst. Sci., 2009

Conditional Probability Tree Estimation Analysis and Algorithms.
Proceedings of the UAI 2009, 2009

The offset tree for learning with partial labels.
Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Paris, France, June 28, 2009

Tutorial summary: Reductions in machine learning.
Proceedings of the 26th Annual International Conference on Machine Learning, 2009

Importance weighted active learning.
Proceedings of the 26th Annual International Conference on Machine Learning, 2009

Error-Correcting Tournaments.
Proceedings of the Algorithmic Learning Theory, 20th International Conference, 2009

2008
Robust reductions from ranking to classification.
Mach. Learn., 2008

Scalable Topology Discovery and Link State Detection Using Routing Events.
Proceedings of the 27th IEEE Symposium on Reliable Distributed Systems (SRDS 2008), 2008

The benefits of directional antennas in heterogeneouswireless ad-hoc networks.
Proceedings of the IEEE 5th International Conference on Mobile Adhoc and Sensor Systems, 2008

2007
Evaluation of Optimization Methods for Network Bottleneck Diagnosis.
Proceedings of the Fourth International Conference on Autonomic Computing (ICAC'07), 2007

2006
Cover trees for nearest neighbor.
Proceedings of the Machine Learning, 2006

2005
IEEE Trans. Neural Networks, 2005

The enumerability of P collapses P to NC.
Theor. Comput. Sci., 2005

Efficient Test Selection in Active Diagnosis via Entropy Approximation.
Proceedings of the UAI '05, 2005

Statictical Models for Unequally Spaced Time Series.
Proceedings of the 2005 SIAM International Conference on Data Mining, 2005

Test-based diagnosis: tree and matrix representations.
Proceedings of the Integrated Network Management, 2005

Error limiting reductions between classification tasks.
Proceedings of the Machine Learning, 2005

Sensitive Error Correcting Output Codes.
Proceedings of the Learning Theory, 18th Annual Conference on Learning Theory, 2005

Weighted One-Against-All.
Proceedings of the Proceedings, 2005

2004
Electronic Colloquium on Computational Complexity (ECCC), 2004

Improving Network Robustness.
Proceedings of the 1st International Conference on Autonomic Computing (ICAC 2004), 2004

2003
The (Non)Enumerability of the Determinant and the Rank.
Theory Comput. Syst., 2003

Approximability of Probability Distributions.
Proceedings of the Advances in Neural Information Processing Systems 16 [Neural Information Processing Systems, 2003

2002
Fast ordering of large categorical datasets for visualization.
Intell. Data Anal., 2002

On the Enumerability of the Determinant and the Rank
Electronic Colloquium on Computational Complexity (ECCC), 2002

On halving line arrangements.
Discret. Math., 2002

Inference Complexity as a Model-Selection Criterion for Learning Bayesian Networks.
Proceedings of the Eights International Conference on Principles and Knowledge Representation and Reasoning (KR-02), 2002

2001
Fast ordering of large categorical datasets for better visualization.
Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining, 2001

1999
One-way functions in worst-case cryptography: algebraic and security properties are on the house.
SIGACT News, 1999

One-Way Functions in Worst-Case Cryptography: Algebraic and Security Properties
CoRR, 1999