Skip to content
conftrace_

Yaron Singer

26 papers · 2015–2025 · 4 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 ↓
+12 more ↓ πŸ—ΊοΈ Taxonomy Completionist (47) πŸƒ Academic Marathon Β· Half 🌍 Conference Polyglot Β· Bronze πŸŒ‰ Interdisciplinary Bridge Β· Silver 🐣 Hot Topic Early Bird
🌟 Keyword Trendsetter Combo (3) 🀝 Dynamic Duo (11) πŸ”¬ Deep Specialist (15) 🧬 Topic Evolution πŸ† Keyword Champion (8) 🧭 Keyword Pioneer πŸ”₯ Unstoppable Β· Bronze ⚑ Prolific Year Β· Productive πŸ—ƒοΈ Keyword Collector (108) πŸ’Ž Century Club Β· Bronze 🌈 Renaissance Researcher (5) πŸ“ˆ Trend Setter

Papers

Large Language Models Encode Semantics and Alignment in Linearly Separable Representations IJCNLP 2025 Tree of Attacks: Jailbreaking Black-Box LLMs Automatically NeurIPS 2024 Instance Specific Approximations for Submodular Maximization ICML 2021 An Optimal Elimination Algorithm for Learning a Best Arm NeurIPS 2020 Investigating Gender Bias in Language Models Using Causal Mediation Analysis NeurIPS 2020 Predicting Choice with Set-Dependent Aggregation ICML 2020 The Adaptive Complexity of Maximizing a Gross Substitutes Valuation NeurIPS 2020 The FAST Algorithm for Submodular Maximization ICML 2020 Fast Parallel Algorithms for Statistical Subset Selection Problems NeurIPS 2019 Robust Influence Maximization for Hyperparametric Models ICML 2019 Approximation Guarantees for Adaptive Sampling ICML 2018 Learning Diffusion using Hyperparameters ICML 2018 Learning to Optimize Combinatorial Functions ICML 2018 Non-monotone Submodular Maximization in Exponentially Fewer Iterations NeurIPS 2018 Optimization for Approximate Submodularity NeurIPS 2018 Minimizing a Submodular Function from Samples NeurIPS 2017 Robust Guarantees of Stochastic Greedy Algorithms ICML 2017 Robust Optimization for Non-Convex Objectives NeurIPS 2017 Submodular Optimization under Noise COLT 2017 The Importance of Communities for Learning to Influence NeurIPS 2017 The Sample Complexity of Optimizing a Convex Function COLT 2017 Learning Sparse Combinatorial Representations via Two-stage Submodular Maximization ICML 2016 Maximization of Approximately Submodular Functions NeurIPS 2016 The Power of Optimization from Samples NeurIPS 2016 Information-theoretic lower bounds for convex optimization with erroneous oracles NeurIPS 2015 Learnability of Influence in Networks NeurIPS 2015