Skip to content
conftrace_

Nika Haghtalab

32 papers · 2014–2026 · 7 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 ↓
+10 more ↓ πŸ—ΊοΈ Taxonomy Completionist (41) πŸƒ Academic Marathon Β· Half 🌍 Conference Polyglot Β· Silver πŸŒ‰ Interdisciplinary Bridge Β· Silver 🐣 Hot Topic Early Bird
πŸ”¬ Deep Specialist (12) 🌟 Keyword Trendsetter Combo (5) 🧭 Keyword Pioneer πŸ—ƒοΈ Keyword Collector (130) ⚑ Prolific Year Β· Productive πŸ“ˆ Trend Setter ❓ The Questioner (3) πŸ”₯ Unstoppable Β· Bronze 🌈 Renaissance Researcher (7) πŸ’Ž Century Club Β· Bronze

Papers

Blackwell Approachability and Gradient Equilibrium are Equivalent COLT 2026 Conference on Learning Theory 2025: Preface COLT 2025 Learning With Multi-Group Guarantees For Clusterable Subpopulations ICML 2025 Can Probabilistic Feedback Drive User Impacts in Online Platforms? AISTATS 2024 Covert Malicious Finetuning: Challenges in Safeguarding LLM Adaptation ICML 2024 Delegating Data Collection in Decentralized Machine Learning AISTATS 2024 Is Knowledge Power? On the (Im)possibility of Learning from Strategic Interactions NeurIPS 2024 Truthfulness of Calibration Measures NeurIPS 2024 A Unifying Perspective on Multi-Calibration: Game Dynamics for Multi-Objective Learning NeurIPS 2023 Calibrated Stackelberg Games: Learning Optimal Commitments Against Calibrated Agents NeurIPS 2023 Competition, Alignment, and Equilibria in Digital Marketplaces AAAI 2023 Improved Bayes Risk Can Yield Reduced Social Welfare Under Competition NeurIPS 2023 Jailbroken: How Does LLM Safety Training Fail? NeurIPS 2023 Open Problem: The Sample Complexity of Multi-Distribution Learning for VC Classes COLT 2023 Smoothed Analysis of Sequential Probability Assignment NeurIPS 2023 Algorithmic Learning Theory 2022: Preface ALT 2022 On-Demand Sampling: Learning Optimally from Multiple Distributions NeurIPS 2022 Oracle-Efficient Online Learning for Smoothed Adversaries NeurIPS 2022 One for One, or All for All: Equilibria and Optimality of Collaboration in Federated Learning ICML 2021 Maximizing Welfare with Incentive-Aware Evaluation Mechanisms IJCAI 2020 Smoothed Analysis of Online and Differentially Private Learning NeurIPS 2020 Structured Robust Submodular Maximization: Offline and Online Algorithms AISTATS 2019 The Provable Virtue of Laziness in Motion Planning IJCAI 2019 Toward a Characterization of Loss Functions for Distribution Learning NeurIPS 2019 Collaborative PAC Learning NeurIPS 2017 Efficient PAC Learning from the Crowd COLT 2017 Online Learning with a Hint NeurIPS 2017 Learning and 1-bit Compressed Sensing under Asymmetric Noise COLT 2016 Three Strategies to Success: Learning Adversary Models in Security Games IJCAI 2016 Efficient Learning of Linear Separators under Bounded Noise COLT 2015 Clustering in the Presence of Background Noise ICML 2014 Learning Optimal Commitment to Overcome Insecurity NeurIPS 2014