Yaron Singer
27 papers · 2015–2025 · 5 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+12 more ↓ Show less ↑
π Conference Polyglot (5) π Interdisciplinary Bridge πΊοΈ Taxonomy Completionist (12) π§ Keyword Pioneer π Academic Marathon (10)
π
Cross-Pollinator
(11)
π
Interdisciplinary Bridge
π
Conference Polyglot
(5)
π§¬
Topic Evolution
π
Keyword Champion
(8)
π€
Dynamic Duo
(11)
π¬
Deep Specialist
(15)
ποΈ
Keyword Collector
(108)
β‘
Prolific Year
(5)
π
Century Club
(27)
π₯
Unstoppable
(7)
π
Trend Setter
Conferences
NIPS (14)
ICML (9)
COLT (2)
AACL (1)
IJCNLP (1)
Top co-authors
Research topics
Keywords
approximation algorithm
(9)
cardinality constraint
(8)
submodular optimization
(8)
submodular maximization
(6)
sample complexity
(6)
combinatorial optimization
(5)
submodular function
(5)
parallel algorithm
(4)
social network
(4)
approximation guarantee
(4)
influence maximization
(3)
independent cascade model
(3)
greedy algorithm
(3)
language model
(2)
stochastic optimization
(2)
convex optimization
(2)
pac learning
(2)
robust optimization
(2)
adaptive sampling
(2)
network analysis
(2)
Papers
Large Language Models Encode Semantics and Alignment in Linearly Separable Representations
AACL 2025
Large Language Models Encode Semantics and Alignment in Linearly Separable Representations
IJCNLP 2025
Tree of Attacks: Jailbreaking Black-Box LLMs Automatically
NIPS 2024
Instance Specific Approximations for Submodular Maximization
ICML 2021
The FAST Algorithm for Submodular Maximization
ICML 2020
An Optimal Elimination Algorithm for Learning a Best Arm
NIPS 2020
Predicting Choice with Set-Dependent Aggregation
ICML 2020
The Adaptive Complexity of Maximizing a Gross Substitutes Valuation
NIPS 2020
Investigating Gender Bias in Language Models Using Causal Mediation Analysis
NIPS 2020
Robust Influence Maximization for Hyperparametric Models
ICML 2019
Fast Parallel Algorithms for Statistical Subset Selection Problems
NIPS 2019
Optimization for Approximate Submodularity
NIPS 2018
Non-monotone Submodular Maximization in Exponentially Fewer Iterations
NIPS 2018
Approximation Guarantees for Adaptive Sampling
ICML 2018
Learning Diffusion using Hyperparameters
ICML 2018
Learning to Optimize Combinatorial Functions
ICML 2018
Submodular Optimization under Noise
COLT 2017
The Importance of Communities for Learning to Influence
NIPS 2017
Robust Guarantees of Stochastic Greedy Algorithms
ICML 2017
Minimizing a Submodular Function from Samples
NIPS 2017
Robust Optimization for Non-Convex Objectives
NIPS 2017
The Sample Complexity of Optimizing a Convex Function
COLT 2017
The Power of Optimization from Samples
NIPS 2016
Maximization of Approximately Submodular Functions
NIPS 2016
Learning Sparse Combinatorial Representations via Two-stage Submodular Maximization
ICML 2016
Information-theoretic lower bounds for convex optimization with erroneous oracles
NIPS 2015
Learnability of Influence in Networks
NIPS 2015