Mohammad Hossein
Bateni
Distinguished Res. Scientist Senior Director of Research
Google, New York
Mohammad Hossein
Bateni
Distinguished Res. Scientist Senior Director of Research
Google, New York

All publications

Data Selection for Fine-tuning Vision Language Models via Cross Modal Alignment Trajectories
Deep learning Theory
  • ICML 2026, the 43rd International Conference on Machine Learning
Resilient Coresets and Consistent Clustering
Approximation algorithms
  • ICML 2026, the 43rd International Conference on Machine Learning
Networked Information Aggregation for Binary Classification
Deep learning Theory
  • ICML 2026, the 43rd International Conference on Machine Learning
Algorithmic Thinking Thoery
Deep learning Theory
  • COLT 2026, The 39th Annual Conference on Learning Theory
How Graphs Can Help You Stay Informed in an Evolving World
ML efficiency
  • WWW 2026, the 35th ACM Web Conference
ZipMoE: A Theoretically-Grounded Mixture of Experts Approach forParameter-Efficient Deep Learning
Deep learning ML efficiency
  • AISTATS 2026, the 29th Annual Conference on Artificial Intelligence and Statistics
Sample-efficient Replicable Median in Polynomial Time
ML efficiency
  • SODA 2026, the 37th ACM-SIAM Symposium on Discrete Algorithms
Replicable Online Pricing
ML efficiency Algorithmic game theory
  • NeurIPS 2025, 39th Annual Conference on Neural Information Processing Systems
DeepCrossAttention: Supercharging Transformer Residual Connections
Deep learning ML efficiency
  • ICML 2025, 42nd International Conference on Machine Learning
Bipartite Ranking From Multiple Labels: On Loss Versus Label Aggregation
Deep learning
  • ICML 2025, 42nd International Conference on Machine Learning
Synthetic Text Generation for Training Large Language Models via Gradient Matching
Deep learning
  • ICML 2025, 42nd International Conference on Machine Learning
Re-Invoke: Tool Invocation Rewriting for Zero-Shot Tool Retrieval
Deep learning ML efficiency
  • EMNLP 2024, Conference on Empirical Methods in Natural Language Processing
Efficient Centroid-Linkage Clustering
Approximation algorithms Fundamental
  • NeurIPS 2024, 38th Annual Conference on Neural Information Processing Systems
SequentialAttention++ for Block Sparsification: Differentiable Pruning Meets Combinatorial Optimization
Deep learning ML efficiency
  • NeurIPS 2024, 38th Annual Conference on Neural Information Processing Systems
Resilient k-Clustering
Approximation algorithms Fundamental Dynamic Large-scale
  • KDD 2024, The 30th International Conference on Knowledge Discovery and Data Mining
Improved Active Covering via Density-based Space Transformation
Approximation algorithms Fundamental ML efficiency Geometric
  • KDD 2024, The 30th International Conference on Knowledge Discovery and Data Mining
Metric Clustering and MST with Strong and Weak Distance Oracles
Approximation algorithms Fundamental
  • COLT 2024, The 37th Annual Conference on Learning Theory
It’s Hard to HAC with Average Linkage!
Approximation algorithms Fundamental
  • ICALP 2024, The 51st International Colloquium on Automata, Languages and Programming
A Scalable Algorithm for Individually Fair K-means Clustering
Approximation algorithms Fundamental
  • AISTATS 2024, The 27th International Conference on Artificial Intelligence and Statistics
Gemini: A Family of Highly Capable Multimodal Models
Deep learning
with many authors
On Complexity of 1-Center in Various Metrics
Approximation algorithms Fundamental
  • APPROX 2023, The 26th International Conference on Approximation Algorithms for Combinatorial Optimization Problems
Active Covering via Density-based Space Transformations
ML efficiency
  • 4th Crowd Science Workshop — CANDLE: Collaboration of Humans and Learning Algorithms for Data Labeling, WSDM 2023
Preference Elicitation for Music Recommendations
ML efficiency
  • ICML 2023, Machine Learning on Graphs Workshop
Graph-Structured Crawling: Model and Approach
ML efficiency
  • MLoG 2023, Machine Learning on Graphs Workshop at WSDM
Data Sampling using Locality Sensitive Hashing for Large Scale Graph Learning
ML efficiency
  • MLG 2023, the 19th International Workshop on Mining and Learning with Graphs
Agile Modeling: From Concept to Classifier in Minutes
ML efficiency Deep learning
  • ICCV 2023, International Conference on Computer Vision
  • NeurIPS 2023 Workshop: Adaptive Experimental Design and Active Learning in the Real World
Sequential Attention for Feature Selection
ML efficiency Deep learning
  • ICLR 2023, The Eleventh International Conference on Learning Representations
Optimal Fully Dynamic k-Center Clustering for Adaptive and Oblivious Adversaries
Dynamic Fundamental
  • SODA 2023, the 34th ACM-SIAM Symposium on Discrete Algorithms
Tackling Provably Hard Representative Selection via Graph Neural Networks
ML efficiency Deep learning
  • TMLR 2023, Transactions on Machine Learning Research
SubMix: Learning to Mix Graph Sampling Heuristics
ML efficiency Deep learning
  • UAI 2023, the 39th Conference on Uncertainty in Artificial Intelligence
Efficient Distributed Algorithms for Minimum Spanning Tree in Dense Graphs
Large-scale Dynamic Fundamental
  • ICDM 2022 Workshop on Incremental Learning
Streaming Belief Propagation for Community Detection
Large-scale Dynamic
  • NeurIPS 2021, 35th Annual Conference on Neural Information Processing Systems
Extreme k-Center Clustering
Large-scale Fundamental
  • AAAI 2021, 35th Annual Conference on Neural Information Processing Systems
Introduction to the Special Issue for SPAA17
Large-scale
  • ACM Trans. Parallel Comput. 6(3): 10:1 (2019)
Categorical Feature Compression via Submodular Optimization
Approximation algorithms Large-scale Fundamental
  • ICML 2019, 36th International Conference on Machine Learning
Distributed Weighted Matching via Randomized Composable Coresets
Approximation algorithms Large-scale Fundamental
  • ICML 2019, 36th International Conference on Machine Learning
Cache-aware load balancing of data center applications
Network design Large-scale
  • PVLDB, 12(6): 709-723, 2019
Polynomial-time Approximation Scheme for Minimum k-cut in Planar and Minor-free Graphs
Large-scale
  • SODA 2019, 30th Annual ACM-SIAM Symposium on Discrete Algorithms
Coresets Meet EDCS: Algorithms for Matching and Vertex Cover on Massive Graphs
Large-scale
  • SODA 2019, 30th Annual ACM-SIAM Symposium on Discrete Algorithms
Optimal Distributed Submodular Optimization via Sketching
Large-scale
  • KDD 2018, 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining
MapReduce Algorithms for Massive Trees
Large-scale
  • ICALP 2018, 45th International Colloquium on Automata, Languages, and Programming
Fast Algorithms for Knapsack via Convolution and Prediction
Fundamental
  • STOC 2018, 50th Annual ACM Symposium on the Theory of Computing
Optimal algorithms for coverage problems on massive data
Large-scale
  • DISCML 2017, NIPS Workshop on Discrete Structures in Machine Learning
On Distributed Hierarchical Clustering
Large-scale
  • NIPS 2017, 30th Annual Conference on Advances in Neural Information Processing Systems
Almost optimal streaming algorithms for coverage problems
Large-scale
  • SPAA 2017, 29th ACM Symposium on Parallelism in Algorithms and Architectures
A study of compact reserve pricing languages
Algorithmic game theory
  • AAAI 2017, 31st AAAI Conference on Artificial Intelligence
Fair Resource Allocation in A Volatile Marketplace
Algorithmic game theory
  • EC 2016, 17th ACM Conference on Economics and Computation
  • NIPS 2018 Workshop on Challenges and Opportunities for AI in Financial Services
  • Oper. Res. 70(1): 288-308 (2022)
A PTAS for planar group Steiner tree via spanner bootstrapping and prize collecting
PTAS Planar Network design Price-collecting clustering
  • STOC 2016, 48th Annual ACM SIGACT Symposium on Theory of Computing
Distributed Balanced Partitioning via Linear Embedding
Large-scale
  • WSDM 2016, Ninth ACM International Conference on Web Search and Data Mining
  • Algorithms 2019, 12(8), 162
  • Google AI Blog (March 14, 2018)
Secretary Problems and Online Auctions
Algorithmic game theory
  • Encyclopedia of Algorithms 2016
Revenue Maximization for Selling Multiple Correlated Items
Algorithmic game theory
  • ESA 2015, 23rd Annual European Symposium of Algorithms
Distributed Balanced Clustering via Mapping Coresets
Large-scale
  • NIPS 2014, 27th Annual Conference on Advances in Neural Information Processing Systems
Multiplicative Bidding in Online Advertising
Algorithmic game theory Approximation algorithms
  • EC 2014, 15th ACM Conference on Economics and Computation
Concise Bid Optimization Strategies with Multiple Budget Constraints
Algorithmic game theory Approximation algorithms PTAS
  • WINE 2014, 10th International Conference on Web and Internet Economics
  • Management Science 2019
Network Cournot Competition
Algorithmic game theory
  • WINE 2014, 10th International Conference on Web and Internet Economics
Revenue Maximization with Nonexcludable Goods
Algorithmic game theory
  • WINE 2013, Ninth International Conference of Web and Internet Economics
  • ACM Transactions of Economics and Computing 3(4): 18 (2015)
Improved Approximation Algorithms for (Budgeted) Node-Weighted Steiner Problems
Approximation algorithms Network design
  • ICALP 2013, 40th International Colloquium on Automata, Languages, and Programming
  • SIAM Journal on Computing, Volume 47, Issue 4, pp. 1275-1293
A polynomial-time approximation scheme for planar multiway cut
PTAS Planar Network design Price-collecting clustering
  • SODA 2012, 23rd Annual ACM-SIAM Symposium on Discrete Algorithms
Towards an efficient algorithmic framework for pricing cellular data service
Algorithmic game theory
  • INFOCOM 2011, 30th Annual Conference of the IEEE Communications Society
Prize-collecting network design on planar graphs
PTAS Approximation algorithms Planar Network design Price-collecting clustering
  • SODA 2011, 22nd Annual ACM-SIAM Symposium on Discrete Algorithms
The submodular secretary problem and its extensions
Approximation algorithms
  • APPROX 2010, 13th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems
  • ACM Trans. Algorithms 9(4): 32 (2013)
Approximation Algorithms for the Directed k-Stroll and k-Tour Problems
Approximation algorithms Network design
  • APPROX 2010, 13th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems
  • Algorithmica 65(3): 545-561 (2013)
Cooperative game theory foundations of network bargaining games
Algorithmic game theory
  • ICALP 2010, 37th International Colloquium on Automata, Languages and Programming
PTASes for Steiner forest on planar graphs and graphs of bounded treewidth
PTAS Planar Network design Price-collecting clustering
  • STOC 2010, 42nd ACM Symposium on Theory of Computing
  • Journal of the ACM 58(5): 21 (2011)
Euclidean Prize-collecting Steiner Forest
PTAS Geometric Network design
  • LATIN 2010, 9th Latin American Theoretical Informatics Symposium
  • Algorithmica 62(3-4): 906-929 (2012)
Improved Approximation Algorithms for Prize-Collecting Steiner Tree and TSP
Approximation algorithms Network design Price-collecting clustering
  • FOCS 2009, 50th Annual IEEE Symposium on Foundations of Computer Science
  • SIAM Journal on Computing, Volume 40, Issue 2, pp. 309-332
A note on the subadditive network design problem
Approximation algorithms Network design
  • Operations Research Letters, Volume 37, Issue 5, Sept. 2009, pp. 339-344
New Approximation Algorithms for Degree Lower-bounded Arborescences and Max-Min Allocation
Approximation algorithms Fair allocation
  • Technical Report TR-848-09, March 2009, Department of Computer Science, Princeton University
Minimizing Staleness and Stretch in Real-Time Data Ware-houses
Scheduling
  • SPAA 2009, 21st ACM Symposium on Parallelism in Algorithms and Architectures
  • Theory of Computing Systems [Special Issue on SPAA 2009], Volume 49, Number 4, pp. 757-780 (2011)
MaxMin allocation via degree lower-bounded arborescences
Approximation algorithms Fair allocation
  • STOC 2009, 41st ACM Symposium on Theory of Computing
Multi-VPN Optimization for Scalable Routing via Relaying
Network design
  • INFOCOM 2009, 28th Annual Conference of the IEEE Communications Society
  • IEEE/ACM Transactions on Networking, Volume 18, Number 5, pp. 1544-1556
Assignment problem in content distribution networks: unsplittable hard-capacitated facility location
PTAS Network design
  • SODA 2009, 20th Annual ACM-SIAM Symposium on Discrete Algorithms
  • ACM Transactions of Algorithms 8(3): 20 (2012)
Plane Embedding of Planar Graph Metrics
Planar Geometric
  • SoCG 2006, 22nd Annual ACM Symposium on Computational Geometry
  • Journal of Discrete and Computational Geometry, Volume 38, Number 3, pp. 615-637