Fetching the paper…
Reading the bibliography…
Submodular function maximization is a critical building block for diverse tasks, such as document summarization, sensor placement, and image segmentation.
An analysis of approximations for maximizing submodular set functions—i
George L Nemhauser, Laurence A Wolsey, and Marshall L Fisher · 1978
Earlier work this paper cites.
An analysis of the greedy algorithm for the submodular set covering problem
Laurence A Wolsey · 1982
Earlier work this paper cites.
A threshold of ln n for approximating set cover
Uriel Feige · 1998
Earlier work this paper cites.
Approximate nearest neighbors: towards removing the curse of dimensionality
Piotr Indyk and Rajeev Motwani · 1998
Earlier work this paper cites.
Maximizing the spread of influence through a social network
David Kempe, Jon Kleinberg, and Éva Tardos · 2003
Earlier work this paper cites.
A note on maximizing a submodular set function subject to a knapsack constraint
Maxim Sviridenko · 2004
Earlier work this paper cites.
The pipelined set cover problem
Kamesh Munagala, Shivnath Babu, Rajeev Motwani, and Jennifer Widom · 2005
Earlier work this paper cites.
Q-clustering
Mukund Narasimhan, Nebojsa Jojic, and Jeff A Bilmes · 2005
Earlier work this paper cites.
Calibrating noise to sensitivity in private data analysis
Cynthia Dwork, Frank McSherry, Kobbi Nissim, and Adam Smith · 2006
Earlier work this paper cites.
Maximizing a submodular set function subject to a matroid constraint
Gruia Calinescu, Chandra Chekuri, Martin Pál, and Jan Vondrák · 2007
Earlier work this paper cites.
Cost-effective outbreak detection in networks
Jure Leskovec, Andreas Krause, Carlos Guestrin, Christos Faloutsos, Jeanne VanBriesen, and Natalie Glance · 2007
Earlier work this paper cites.
Mechanism design via differential privacy
Frank McSherry and Kunal Talwar · 2007
Earlier work this paper cites.
An online algorithm for maximizing submodular functions
Matthew Streeter and Daniel Golovin · 2008
Earlier work this paper cites.
Combining multiple constraint solvers: Results on the cpai’06 competition data
Matthew Streeter, Daniel Golovin, and Stephen F Smith · 2008
Earlier work this paper cites.
Simultaneous placement and scheduling of sensors
Andreas Krause, Ram Rajagopal, Anupam Gupta, and Carlos Guestrin · 2009
Earlier work this paper cites.
Structured sparsity-inducing norms through submodular functions
Francis Bach · 2010
Earlier work this paper cites.
Boosting and differential privacy
Cynthia Dwork, Guy N Rothblum, and Salil Vadhan · 2010
Earlier work this paper cites.
Interactive submodular set cover
Andrew Guillory and Jeff Bilmes · 2010
Earlier work this paper cites.
Causal markov condition for submodular information measures
Bastian Steudel, Dominik Janzing, and Bernhard Schölkopf · 2010
Earlier work this paper cites.
Maximizing a monotone submodular function subject to a matroid constraint
Gruia Calinescu, Chandra Chekuri, Martin Pal, and Jan Vondrák · 2011
Earlier work this paper cites.
Abhimanyu Das and David Kempe · 2011
Earlier work this paper cites.
Adaptive submodularity: Theory and applications in active learning and stochastic optimization
Daniel Golovin and Andreas Krause · 2011
Earlier work this paper cites.
Adaptive submodularity: Theory and applications in active learning and stochastic optimization
Daniel Golovin and Andreas Krause · 2011
Earlier work this paper cites.
Submodularity beyond submodular energies: coupling edges in graph cuts
Stefanie Jegelka and Jeff Bilmes · 2011
Earlier work this paper cites.
A class of submodular functions for document summarization
Hui Lin and Jeff Bilmes · 2011
Earlier work this paper cites.
Word alignment via submodular maximization over matroids
Hui Lin and Jeff Bilmes · 2011
Earlier work this paper cites.
Linear submodular bandits and their application to diversified retrieval
Yisong Yue and Carlos Guestrin · 2011
Earlier work this paper cites.
Optimization with sparsity-inducing penalties
Francis Bach, Rodolphe Jenatton, Julien Mairal, Guillaume Obozinski, et al · 2012
Earlier work this paper cites.
Near-optimal nonmyopic value of information in graphical models
Andreas Krause and Carlos E Guestrin · 2012
Earlier work this paper cites.
Adaptive submodular maximization in bandit setting
Victor Gabillon, Branislav Kveton, Zheng Wen, Brian Eriksson, and Shanmugavelayutham Muthukrishnan · 2013
Earlier work this paper cites.
From map to marginals: Variational inference in bayesian submodular models
Josip Djolonga and Andreas Krause · 2014
Earlier work this paper cites.
The algorithmic foundations of differential privacy
Cynthia Dwork, Aaron Roth, et al · 2014
Earlier work this paper cites.
Near-optimally teaching the crowd to classify
Adish Singla, Ilija Bogunovic, Gábor Bartók, Amin Karbasi, and Andreas Krause · 2014
Cited alongside, same era.
Learning mixtures of submodular functions for image collection summarization
Sebastian Tschiatschek, Rishabh K Iyer, Haochen Wei, and Jeff A Bilmes · 2014
Cited alongside, same era.
Optimal data-dependent hashing for approximate near neighbors
Alexandr Andoni and Ilya Razenshteyn · 2015
Cited alongside, same era.
Mechanisms for fair attribution
Eric Balkanski and Yaron Singer · 2015
Cited alongside, same era.
Lazier than lazy greedy
Baharan Mirzasoleiman, Ashwinkumar Badanidiyuru, Amin Karbasi, Jan Vondrák, and Andreas Krause · 2015
Cited alongside, same era.
Submodularity in data subset selection and active learning
Kai Wei, Rishabh Iyer, and Jeff Bilmes · 2015
Cited alongside, same era.
Josh Alman, Jiehao Liang, Zhao Song, Ruizhe Zhang, and Danyang Zhuo · 2022
Later among the works it cites.
Uniform approximations for randomized hadamard transforms with applications
Yeshwanth Cherapanamjeri and Jelani Nelson · 2022
Later among the works it cites.
Discrepancy minimization in input-sparsity time
Yichuan Deng, Zhao Song, and Omri Weinstein · 2022
Later among the works it cites.
A sublinear adversarial training algorithm
Yeqi Gao, Lianke Qin, Zhao Song, and Yitan Wang · 2022
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Submodular variational inference for network reconstruction
Lin Chen, Forrest W Crawford, and Amin Karbasi · 2016
Cited alongside, same era.
Submodular variational inference for network reconstruction
Lin Chen, Forrest W Crawford, and Amin Karbasi · 2016
Cited alongside, same era.
L Elisa Celis, Amit Deshpande, Tarun Kathuria, and Nisheeth K Vishnoi · 2016
Cited alongside, same era.
Influence estimation and maximization in continuous-time diffusion networks
Manuel Gomez-Rodriguez, Le Song, Nan Du, Hongyuan Zha, and Bernhard Schölkopf · 2016
Cited alongside, same era.
Linear submodular bandits with a knapsack constraint
Baosheng Yu, Meng Fang, and Dacheng Tao · 2016
Cited alongside, same era.
Influence maximization in messenger-based social networks
Yuanxing Zhang, Yichong Bai, Lin Chen, Kaigui Bian, and Xiaoming Li · 2016
Cited alongside, same era.
Yuzhou Gu and Zhao Song · 2022
Later among the works it cites.
Training overparametrized neural networks in sublinear time
Hang Hu, Zhao Song, Omri Weinstein, and Danyang Zhuo · 2022
Later among the works it cites.
Adore: Differentially oblivious relational database operators
Lianke Qin, Rajesh Jayaram, Elaine Shi, Zhao Song, Danyang Zhuo, and Shumo Chu · 2022
Later among the works it cites.
Adaptive and dynamic multi-resolution hashing for pairwise summations
Lianke Qin, Aravind Reddy, Zhao Song, Zhaozhuo Xu, and Danyang Zhuo · 2022
Later among the works it cites.
Speeding up sparsification using inner product search data structures
Zhao Song, Zhaozhuo Xu, and Lichen Zhang · 2022
Later among the works it cites.
Faster algorithm for structured john ellipsoid computation
Zhao Song, Xin Yang, Yuanyuan Yang, and Tianyi Zhou · 2022
Later among the works it cites.
Speeding up optimizations via data structures: Faster search, sample and maintenance
Lichen Zhang · 2022
Later among the works it cites.
Differentially private approximate near neighbor counting in high dimensions
Alexandr Andoni, Piotr Indyk, Sepideh Mahabadi, and Shyam Narayanan · 2023
Closest in time.
Robust algorithms on adaptive inputs from bounded adversaries
Yeshwanth Cherapanamjeri, Sandeep Silwal, David P Woodruff, Fred Zhang, Qiuyi Zhang, and Samson Zhou · 2023
Closest in time.
Attention scheme inspired softmax regression
Yichuan Deng, Zhihang Li, and Zhao Song · 2023
Closest in time.
An improved sample complexity for rank-1 matrix sensing
Yichuan Deng, Zhihang Li, and Zhao Song · 2023
Closest in time.
Randomized and deterministic attention sparsification algorithms for over-parameterized feature dimension
Yichuan Deng, Sridhar Mahadevan, and Zhao Song · 2023
Closest in time.
An iterative algorithm for rescaled hyperbolic functions regression
Yeqi Gao, Zhao Song, and Junze Yin · 2023
Closest in time.
Differentially private attention computation
Yeqi Gao, Zhao Song, Xin Yang, and Yufa Zhou · 2023
Closest in time.
Low rank matrix completion via robust alternating minimization in nearly linear time
Yuzhou Gu, Zhao Song, Junze Yin, and Lichen Zhang · 2023
Closest in time.
Convex minimization with integer minima in O ~ ( n 4 ) \widetilde{O}(n^{4}) time
Haotian Jiang, Yin Tat Lee, Zhao Song, and Lichen Zhang · 2023
Closest in time.
Differentially private one permutation hashing and bin-wise consistent weighted sampling
Xiaoyun Li and Ping Li · 2023
Closest in time.
Solving regularized exp, cosh and sinh regression problems
Zhihang Li, Zhao Song, and Tianyi Zhou · 2023
Closest in time.
How to dp-fy ml: A practical guide to machine learning with differential privacy
Natalia Ponomareva, Hussein Hazimeh, Alex Kurakin, Zheng Xu, Carson Denison, H Brendan McMahan, Sergei Vassilvitskii, Steve Chien, and Abhradeep Guha Thakurta · 2023
Closest in time.
A general algorithm for solving rank-one matrix sensing
Lianke Qin, Zhao Song, and Ruizhe Zhang · 2023
Closest in time.
An online and unified algorithm for projection matrix vector multiplication with application to empirical risk minimization
Lianke Qin, Zhao Song, Lichen Zhang, and Danyang Zhuo · 2023
Closest in time.
Sketching for first order method: Efficient algorithm for low-bandwidth channel and vulnerability
Zhao Song, Yitan Wang, Zheng Yu, and Lichen Zhang · 2023
Closest in time.
Sketching meets differential privacy: fast algorithm for dynamic kronecker projection maintenance
Zhao Song, Xin Yang, Yuanyuan Yang, and Lichen Zhang · 2023
Closest in time.
On differentially private string distances
Jerry Yao-Chieh Hu, Erzhi Liu, Han Liu, Zhao Song, and Lichen Zhang · 2024
Closest in time.
Differentially private kernel density estimation
Erzhi Liu, Jerry Yao-Chieh Hu, Alex Reneau, Zhao Song, and Han Liu · 2024
Closest in time.
Towards the robustness of differentially private federated learning
Tao Qi, Huili Wang, and Yongfeng Huang · 2024
Closest in time.
Whispered tuning: Data privacy preservation in fine-tuning llms through differential privacy
Tanmay Singh, Harshvardhan Aditya, Vijay K Madisetti, and Arshdeep Bahga · 2024
Closest in time.
On differential privacy for adaptively solving search problems via sketching
Shiyuan Feng, Ying Feng, George Zhaoqi Li, Zhao Song, David Woodruff, and Lichen Zhang · 2025
Closest in time.