Skip to content
conftrace_

Alon Orlitsky

34 papers · 2003–2024 · 5 venues · across top CS/AI venues

Authors are matched by name, so researchers who share a name ("Yang Liu", "Wei Wang") appear as a single profile and their paper counts, venues and achievements are combined. How identity is handled.

Jump to papers ↓
+11 more ↓ πŸ—ΊοΈ Taxonomy Completionist (37) πŸƒ Academic Marathon Β· Ultra 🌍 Conference Polyglot Β· Silver πŸŒ‰ Interdisciplinary Bridge Β· Silver 🐣 Hot Topic Early Bird
πŸ”¬ Deep Specialist (21) 🀝 Dynamic Duo (11) πŸ† Keyword Champion (2) 🧭 Keyword Pioneer πŸš€ Conference Pioneer πŸ“ˆ Trend Setter ⚑ Prolific Year Β· Productive πŸ—ƒοΈ Keyword Collector (145) πŸ”₯ Unstoppable Β· Silver 🌈 Renaissance Researcher (5) πŸ’Ž Century Club Β· Bronze

Papers

Linear Regression using Heterogeneous Data Batches NeurIPS 2024 TURF: Two-Factor, Universal, Robust, Fast Distribution Learning Algorithm ICML 2022 Compressed Maximum Likelihood ICML 2021 Robust Density Estimation from Batches: The Best Things in Life are (Nearly) Free ICML 2021 A General Method for Robust Learning from Batches NeurIPS 2020 Data Amplification: Instance-Optimal Property Estimation ICML 2020 Linear-Sample Learning of Low-Rank Distributions NeurIPS 2020 Optimal Robust Learning of Discrete Distributions from Batches ICML 2020 Optimal Sequential Maximization: One Interview is Enough! ICML 2020 Profile Entropy: A Fundamental Measure for the Learnability and Compressibility of Distributions NeurIPS 2020 SURF: A Simple, Universal, Robust, Fast Distribution Learning Algorithm NeurIPS 2020 Towards Competitive N-gram Smoothing AISTATS 2020 Doubly-Competitive Distribution Estimation ICML 2019 The Broad Optimality of Profile Maximum Likelihood NeurIPS 2019 Unified Sample-Optimal Property Estimation in Near-Linear Time NeurIPS 2019 Data Amplification: A Unified and Competitive Approach to Property Estimation NeurIPS 2018 Maximum Selection and Sorting with Adversarial Comparators JMLR 2018 On Learning Markov Chains NeurIPS 2018 The Limits of Maxing, Ranking, and Preference Learning ICML 2018 A Unified Maximum Likelihood Approach for Estimating Symmetric Properties of Discrete Distributions ICML 2017 Maximum Selection and Ranking under Noisy Comparisons ICML 2017 Maxing and Ranking with Few Assumptions NeurIPS 2017 The power of absolute discounting: all-dimensional distribution estimation NeurIPS 2017 Near-Optimal Smoothing of Structured Conditional Probability Matrices NeurIPS 2016 Competitive Distribution Estimation: Why is Good-Turing Good NeurIPS 2015 Faster Algorithms for Testing under Conditional Sampling COLT 2015 On Learning Distributions from their Samples COLT 2015 Near-Optimal-Sample Estimators for Spherical Gaussian Mixtures NeurIPS 2014 A Competitive Test for Uniformity of Monotone Distributions AISTATS 2013 Optimal Probability Estimation with Applications to Prediction and Classification COLT 2013 Competitive Classification and Closeness Testing COLT 2012 Tight Bounds on Profile Redundancy and Distinguishability NeurIPS 2012 Competitive Closeness Testing COLT 2011 On Nearest-Neighbor Error-Correcting Output Codes with Application to All-Pairs Multiclass Support Vector Machines JMLR 2003