Vahab Mirrokni

Identifiers

• name variant Vahab Mirrokni 0.60 · backfill

Papers (133)

1. Geometric Signatures of Reasoning: A Spectral Perspective on Task Hardness cs.LG · 2026 · author #4
2. Towards Automating Scientific Review with Google's Paper Assistant Tool cs.LG · 2026 · author #6
3. Language Models Need Sleep: Learning to Self-Modify and Consolidate Memories cs.LG · 2026 · author #3
4. Gemini 2.5: Pushing the Frontier with Advanced Reasoning, Multimodality, Long Context, and Next Generation Agentic Capabilities cs.CL · 2025 · author #3100
5. TurboQuant: Online Vector Quantization with Near-optimal Distortion Rate cs.LG · 2025 · author #4
6. Gemma 3 Technical Report cs.CL · 2025 · author #188
7. Titans: Learning to Memorize at Test Time cs.LG · 2024 · author #3
8. Auto-bidding and Auctions in Online Advertising: A Survey cs.GT · 2024 · author #13
9. Perturb-and-Project: Differentially Private Similarities and Marginals cs.LG · 2024 · author #4
10. High-Dimensional Geometric Streaming for Nearly Low Rank Data cs.DS · 2024 · author #2
11. Optimistic Rates for Learning from Label Proportions cs.LG · 2024 · author #4
12. MUVERA: Multi-Vector Retrieval via Fixed Dimensional Encodings cs.DS · 2024 · author #5
13. Understanding Transformer Reasoning Capabilities via Graph Algorithms cs.LG · 2024 · author #8
14. Optimal Communication for Classic Functions in the Coordinator Model and Beyond cs.DS · 2024 · author #3
15. Gemini 1.5: Unlocking multimodal understanding across millions of tokens of context cs.CL · 2024 · author #666
16. Data-Efficient Learning via Clustering-Based Sensitivity Sampling: Foundation Models and Beyond cs.LG · 2024 · author #5
17. SubGen: Token Generation in Sublinear Time and Memory cs.LG · 2024 · author #3
18. PriorBoost: An Adaptive Algorithm for Learning from Aggregate Responses cs.LG · 2024 · author #3
19. Learning from Aggregate responses: Instance Level versus Bag Level Loss Functions cs.LG · 2024 · author #3
20. Non-uniform Bid-scaling and Equilibria for Different Auctions: An Empirical Study cs.GT · 2023 · author #3
21. Mechanism Design for Large Language Models cs.GT · 2023 · author #2
22. HyperAttention: Long-context Attention in Near-Linear Time cs.LG · 2023 · author #4
23. Anonymous Learning via Look-Alike Clustering: A Precise Analysis of Model Generalization cs.LG · 2023 · author #2
24. Efficiency of the Generalized Second-Price Auction for Value Maximizers cs.GT · 2023 · author #4
25. PolySketchFormer: Fast Transformers via Sketching Polynomial Kernels cs.LG · 2023 · author #2
26. TeraHAC: Hierarchical Agglomerative Clustering of Trillion-Edge Graphs cs.DS · 2023 · author #4
27. Massively Parallel Algorithms for High-Dimensional Euclidean Minimum Spanning Tree cs.DS · 2023 · author #2
28. Causal Estimation of User Learning in Personalized Systems stat.ME · 2023 · author #5
29. Learning across Data Owners with Joint Differential Privacy cs.LG · 2023 · author #6
30. Learning from Aggregated Data: Curated Bags versus Random Bags cs.LG · 2023 · author #4
31. Robust and differentially private stochastic linear bandits cs.LG · 2023 · author #3
32. Measuring Re-identification Risk cs.CR · 2023 · author #8
33. Learning Rate Schedules in the Presence of Distribution Shift cs.LG · 2023 · author #3
34. Optimal Fully Dynamic $k$-Center Clustering for Adaptive and Oblivious Adversaries cs.DS · 2023 · author #6
35. A Field Guide for Pacing Budget and ROS Constraints cs.GT · 2023 · author #5
36. Approximately Optimal Core Shapes for Tensor Decompositions cs.DS · 2023 · author #4
37. Robust Budget Pacing with a Single Sample cs.LG · 2023 · author #3
38. Multi-channel Autobidding with Budget and ROI Constraints cs.GT · 2023 · author #5
39. Autobidding Auctions in the Presence of User Costs cs.GT · 2023 · author #3
40. Differentially-Private Hierarchical Clustering with Provable Approximation Guarantees cs.LG · 2023 · author #5
41. Differentially Private Continual Releases of Streaming Frequency Moment Estimations cs.DS · 2023 · author #4
42. Constant Approximation for Normalized Modularity and Associations Clustering cs.DS · 2022 · author #2
43. Stars: Tera-Scale Graph Building for Clustering and Graph Learning cs.LG · 2022 · author #4
44. Cluster Randomized Designs for One-Sided Bipartite Experiments stat.ME · 2022 · author #2
45. Anonymous Bandits for Multi-User Systems cs.LG · 2022 · author #2
46. Replicable Bandits cs.LG · 2022 · author #5
47. Sequential Attention for Feature Selection cs.LG · 2022 · author #6
48. Individual Welfare Guarantees in the Autobidding World with Machine-learned Advice cs.GT · 2022 · author #5
49. Efficiency of the First-Price Auction in the Autobidding World cs.GT · 2022 · author #3
50. Differentially Private Graph Learning via Sensitivity-Bounded Personalized PageRank cs.CR · 2022 · author #2
51. Smooth Anonymity for Sparse Graphs cs.CR · 2022 · author #3
52. TF-GNN: Graph Neural Networks in TensorFlow cs.LG · 2022 · author #19
53. Scalable Differentially Private Clustering via Hierarchically Separated Trees cs.DS · 2022 · author #4
54. Hierarchical Clustering in Graph Streams: Single-Pass Algorithms and Space Lower Bounds cs.DS · 2022 · author #4
55. Tackling Provably Hard Representative Selection via Graph Neural Networks cs.LG · 2022 · author #7
56. Improved Approximations for Euclidean $k$-means and $k$-median, via Nested Quasi-Independent Sets cs.DS · 2022 · author #3
57. Analysis of Dual-Based PID Controllers through Convolutional Mirror Descent math.OC · 2022 · author #3
58. Optimal Fully Dynamic $k$-Centers Clustering cs.DS · 2021 · author #4
59. Synthetic Design: An Optimization Approach to Experimental Design with Synthetic Controls stat.ME · 2021 · author #6
60. Robust Auction Design in the Auto-bidding World cs.GT · 2021 · author #4
61. Improved Sliding Window Algorithms for Clustering and Coverage via Bucketing-Based Sketches cs.DS · 2021 · author #3
62. Tight and Robust Private Mean Estimation with Few Users cs.DS · 2021 · author #2
63. Label differential privacy via clustering cs.LG · 2021 · author #2
64. Scalable Community Detection via Parallel Correlation Clustering cs.SI · 2021 · author #5
65. Learning to Price against a Budget and ROI Constrained Buyer cs.GT · 2021 · author #4
66. Almost Tight Approximation Algorithms for Explainable Clustering cs.LG · 2021 · author #2
67. Hierarchical Agglomerative Graph Clustering in Nearly-Linear Time cs.DS · 2021 · author #4
68. Massively Parallel and Dynamic Algorithms for Minimum Size Clustering cs.DS · 2021 · author #3
69. Parallelizing Thompson Sampling cs.LG · 2021 · author #2
70. Towards Efficient Auctions in an Auto-bidding World cs.GT · 2021 · author #3
71. Design and Analysis of Bipartite Experiments under a Linear Exposure-Response Model stat.ME · 2021 · author #4
72. Batched Neural Bandits cs.LG · 2021 · author #4
73. The Best of Many Worlds: Dual Mirror Descent for Online Allocation Problems cs.DS · 2020 · author #3
74. Limiting Behaviors of Nonconvex-Nonconcave Minimax Optimization via Continuous-Time Systems math.OC · 2020 · author #4
75. Causal Inference with Bipartite Designs stat.ME · 2020 · author #5
76. Parallel Graph Algorithms in Constant Adaptive Rounds: Theory meets Practice cs.DC · 2020 · author #5
77. Regularized Online Allocation Problems: Fairness and Beyond math.OC · 2020 · author #3
78. The Landscape of the Proximal Point Method for Nonconvex-Nonconcave Minimax Optimization math.OC · 2020 · author #4
79. Bandits with adversarial scaling cs.LG · 2020 · author #2
80. Dynamic Incentive-aware Learning: Robust Pricing in Contextual Auctions cs.LG · 2020 · author #3
81. Dual Mirror Descent for Online Allocation Problems math.OC · 2020 · author #3
82. Contextual Reserve Price Optimization in Auctions via Mixed-Integer Programming math.OC · 2020 · author #4
83. Adaptivity in Adaptive Submodularity cs.LG · 2019 · author #3
84. Fully Dynamic Matching: Beating 2-Approximation in $\Delta^\epsilon$ Update Time cs.DS · 2019 · author #3
85. Near-Optimal Massively Parallel Graph Connectivity cs.DS · 2019 · author #5
86. Regret Bounds for Batched Bandits cs.DS · 2019 · author #4
87. Streaming Balanced Clustering cs.DS · 2019 · author #2
88. Dynamic First Price Auctions Robust to Heterogeneous Buyers cs.GT · 2019 · author #3
89. Distributed Weighted Matching via Randomized Composable Coresets cs.DC · 2019 · author #3
90. Massively Parallel Computation via Remote Memory Access cs.DC · 2019 · author #6
91. Accelerating Gradient Boosting Machine cs.LG · 2019 · author #4
92. Optimal Dynamic Auctions are Virtual Welfare Maximizers cs.GT · 2018 · author #1
93. Approximate Leave-One-Out for High-Dimensional Non-Differentiable Learning Problems cs.LG · 2018 · author #5
94. Contextual Bandits with Cross-learning cs.LG · 2018 · author #4
95. Massively Parallel Dynamic Programming on Trees cs.DS · 2018 · author #5
96. Non-monotone Submodular Maximization with Nearly Optimal Adaptivity and Query Complexity cs.DS · 2018 · author #2
97. Parallel and Streaming Algorithms for K-Core Decomposition cs.DS · 2018 · author #3
98. Connected Components at Scale via Local Contractions cs.DC · 2018 · author #2
99. Submodular Maximization with Nearly Optimal Approximation, Adaptivity and Query Complexity cs.DS · 2018 · author #2
100. Approximate Leave-One-Out for Fast Parameter Tuning in High Dimensions stat.ML · 2018 · author #5
101. Accelerating Greedy Coordinate Descent Methods math.OC · 2018 · author #3
102. Stochastic bandits robust to adversarial corruptions cs.LG · 2018 · author #2
103. Optimizing cluster-based randomized experiments under a monotonicity assumption stat.ME · 2018 · author #3
104. Robust Repeated Auctions under Heterogeneous Buyer Behavior cs.GT · 2018 · author #3
105. ASYMP: Fault-tolerant Mining of Massive Graphs cs.DC · 2017 · author #3
106. Online Submodular Welfare Maximization: Greedy Beats 1/2 in Random Order cs.DS · 2017 · author #2
107. Online Allocation with Traffic Spikes: Mixing Adversarial and Stochastic Models cs.DS · 2017 · author #3
108. Coresets Meet EDCS: Algorithms for Matching and Vertex Cover on Massive Graphs cs.DS · 2017 · author #4
109. Overcommitment in Cloud Services -- Bin packing with Chance Constraints cs.DS · 2017 · author #3
110. Matroids Hitting Sets and Unsupervised Dependency Grammar Induction cs.DM · 2017 · author #2
111. Distributed Coverage Maximization via Sketching cs.DS · 2016 · author #3
112. Randomized Experimental Design via Geographic Clustering cs.SI · 2016 · author #5
113. Almost Optimal Streaming Algorithms for Coverage Problems cs.DS · 2016 · author #3
114. Consistent Hashing with Bounded Loads cs.DS · 2016 · author #1
115. Optimal dynamic mechanisms with ex-post IR via bank accounts cs.GT · 2016 · author #1
116. Greedy Column Subset Selection: New Bounds and Distributed Algorithms cs.DS · 2016 · author #4
117. Tight Bounds for Approximate Carath\'eodory and Beyond cs.DS · 2015 · author #1
118. Distributed Balanced Partitioning via Linear Embedding cs.DC · 2015 · author #3
119. Expanders via Local Edge Flips cs.DS · 2015 · author #4
120. Randomized Composable Core-sets for Distributed Submodular Maximization cs.DS · 2015 · author #1
121. Multiplicative Bidding in Online Advertising cs.DS · 2014 · author #3
122. Clinching Auctions Beyond Hard Budget Constraints cs.GT · 2014 · author #2
123. Local Graph Clustering Beyond Cheeger's Inequality cs.DS · 2013 · author #3
124. Clinching Auctions with Online Supply cs.GT · 2012 · author #2
125. On the Implications of Lookahead Search in Game Playing cs.GT · 2012 · author #1
126. Polyhedral Clinching Auctions and the Adwords Polytope cs.GT · 2012 · author #2
127. On the Non-Progressive Spread of Influence through Social Networks cs.SI · 2011 · author #5
128. Yield Optimization of Display Advertising with Ad Exchange math.OC · 2011 · author #3
129. Quasi-Proportional Mechanisms: Prior-free Revenue Maximization cs.GT · 2009 · author #1
130. Online Stochastic Matching: Beating 1-1/e cs.DS · 2009 · author #3
131. On the complexity of Nash dynamics and Sink Equilibria cs.GT · 2009 · author #1
132. Non-monotone submodular maximization under matroid and knapsack constraints cs.CC · 2009 · author #2
133. Bid Optimization in Broad-Match Ad auctions cs.GT · 2009 · author #3

Mentions

• 2408.07685 #13 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 2406.04868 #4 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 2310.10826 #2 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 2303.15634 #3 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 2302.03886 #4 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 2209.14881 #6 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 2308.03578 #4 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 2406.02910 #2 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 2406.00487 #4 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 2405.18512 #8 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 2207.06358 #3 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 2403.20307 #3 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 2310.01655 #2 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 2402.17327 #5 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 2207.06944 #2 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 2402.06082 #3 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 2402.04987 #3 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 2401.11081 #3 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 2202.06152 #3 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 2302.08530 #5 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 2310.05869 #4 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 2311.10679 #3 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 2310.04015 #2 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 2310.03105 #4 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 2308.00503 #2 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 2304.07210 #8 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 2207.03522 #19 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 2205.10403 #7 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 2302.01523 #5 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 2209.04748 #5 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 2306.00485 #5 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 2305.15723 #6 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 2302.00037 #5 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 2305.09557 #4 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 2304.11741 #3 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 1808.06932 #2 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 1807.07889 #2 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 2303.11843 #6 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 2210.01898 #5 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 2107.07725 #4 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 2302.02006 #3 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 2302.00377 #3 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 2301.05605 #4 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 2212.02635 #4 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 2212.14334 #2 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 2210.16415 #2 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 2210.12198 #2 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 2208.10650 #3 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 2206.08646 #4 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 2206.07554 #4 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 2110.11876 #2 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 2204.04828 #3 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 2112.07050 #4 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 2112.00278 #6 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 2103.06392 #4 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 1809.09582 #4 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 1605.08795 #4 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 2011.10124 #3 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 2007.00514 #3 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 2002.10421 #3 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 2111.02468 #4 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 2110.15533 #3 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 2110.02159 #2 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 2108.01731 #5 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 2107.00774 #2 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 2106.05610 #4 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 2106.02685 #3 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 2106.01420 #2 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 2006.08667 #4 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 2103.13356 #3 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 2010.10628 #4 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 2102.13028 #4 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 2010.02108 #5 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 2002.08841 #4 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 2009.11552 #5 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 2003.02287 #2 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 1903.08708 #4 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 1911.03620 #3 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 1910.05385 #5 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 2002.11137 #3 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 1910.04959 #4 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 1911.01839 #3 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 1910.00788 #2 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 1906.03286 #3 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 1906.01993 #3 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 1905.07533 #6 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 1803.00494 #3 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 1611.03780 #5 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 1711.03076 #4 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 1812.02993 #1 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 1808.02546 #3 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 1810.02716 #5 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 1809.03685 #5 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 1807.10727 #2 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 1807.02694 #5 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 1806.02476 #3 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 1803.09353 #2 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 1803.02876 #3 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 1712.09731 #3 · arxiv_oai · confidence 0.70 Vahab Mirrokni
• 1712.05450 #2 · arxiv_oai · confidence 0.70 Vahab Mirrokni

Frequent Coauthors

• Hossein Esfandiari 24 shared papers
• Peilin Zhong 14 shared papers
• Haihao Lu 13 shared papers
• MohammadHossein Bateni 11 shared papers
• Alessandro Epasto 10 shared papers
• Jakub {\L}\k{a}cki 10 shared papers
• Jieming Mao 10 shared papers
• Renato Paes Leme 10 shared papers
• Song Zuo 10 shared papers
• Jean Pouget-Abadie 9 shared papers
• Yuan Deng 9 shared papers
• Adel Javanmard 8 shared papers
• Amin Karbasi 8 shared papers
• Morteza Zadimoghaddam 8 shared papers
• Rajesh Jayaram 8 shared papers
• Anton Tsitsulin 7 shared papers
• Laxman Dhulipala 7 shared papers
• Mohammad Mahdian 7 shared papers
• Santiago Balseiro 7 shared papers
• Silvio Lattanzi 7 shared papers