default search action
Mukund Sundararajan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c40]Walid Krichene, Prateek Jain, Shuang Song, Mukund Sundararajan, Abhradeep Guha Thakurta, Li Zhang:
Multi-Task Differential Privacy Under Distribution Skew. ICML 2023: 17784-17807 - [c39]Mukund Sundararajan, Walid Krichene:
Inflow, Outflow, and Reciprocity in Machine Learning. ICML 2023: 33195-33208 - [c38]Mihaela Curmei, Walid Krichene, Li Zhang, Mukund Sundararajan:
Private Matrix Factorization with Public Item Features. RecSys 2023: 805-812 - [i27]Walid Krichene, Prateek Jain, Shuang Song, Mukund Sundararajan, Abhradeep Thakurta, Li Zhang:
Multi-Task Differential Privacy Under Distribution Skew. CoRR abs/2302.07975 (2023) - [i26]Sid Mittal, Vineet Gupta, Frederick Liu, Mukund Sundararajan:
Using Foundation Models to Detect Policy Violations with Minimal Supervision. CoRR abs/2306.06234 (2023) - [i25]Mihaela Curmei, Walid Krichene, Li Zhang, Mukund Sundararajan:
Private Matrix Factorization with Public Item Features. CoRR abs/2309.11516 (2023) - 2022
- [c37]Chih-Kuan Yeh, Ankur Taly, Mukund Sundararajan, Frederick Liu, Pradeep Ravikumar:
First is Better Than Last for Language Data Influence. NeurIPS 2022 - [i24]Mukund Sundararajan, Walid Krichene:
Reciprocity in Machine Learning. CoRR abs/2202.09480 (2022) - [i23]Chih-Kuan Yeh, Ankur Taly, Mukund Sundararajan, Frederick Liu, Pradeep Ravikumar:
First is Better Than Last for Training Data Influence. CoRR abs/2202.11844 (2022) - [i22]Arya Tafvizi, Besim Avci, Mukund Sundararajan:
Attributing AUC-ROC to Analyze Binary Classifier Performance. CoRR abs/2205.11781 (2022) - 2020
- [j13]Mukund Sundararajan, Qiqi Yan:
Robust mechanisms for risk-averse sellers. Games Econ. Behav. 124: 644-658 (2020) - [c36]Shawn Xu, Subhashini Venugopalan, Mukund Sundararajan:
Attribution in Scale and Space. CVPR 2020: 9677-9686 - [c35]Mukund Sundararajan, Kedar Dhamdhere, Ashish Agarwal:
The Shapley Taylor Interaction Index. ICML 2020: 9259-9268 - [c34]Mukund Sundararajan, Amir Najmi:
The Many Shapley Values for Model Explanation. ICML 2020: 9269-9278 - [c33]Garima Pruthi, Frederick Liu, Satyen Kale, Mukund Sundararajan:
Estimating Training Data Influence by Tracing Gradient Descent. NeurIPS 2020 - [i21]Garima Pruthi, Frederick Liu, Mukund Sundararajan, Satyen Kale:
Estimating Training Data Influence by Tracking Gradient Descent. CoRR abs/2002.08484 (2020) - [i20]Shawn Xu, Subhashini Venugopalan, Mukund Sundararajan:
Attribution in Scale and Space. CoRR abs/2004.03383 (2020) - [i19]Frederick Liu, Amir Najmi, Mukund Sundararajan:
The Penalty Imposed by Ablated Data Augmentation. CoRR abs/2006.04769 (2020)
2010 – 2019
- 2019
- [c32]Kedar Dhamdhere, Mukund Sundararajan, Qiqi Yan:
How Important is a Neuron. ICLR (Poster) 2019 - [c31]Mukund Sundararajan, Jinhua Xu, Ankur Taly, Rory Sayres, Amir Najmi:
Exploring Principled Visualizations for Deep Network Attributions. IUI Workshops 2019 - [i18]Ashish Agarwal, Kedar Dhamdhere, Mukund Sundararajan:
A New Interaction Index inspired by the Taylor Series. CoRR abs/1902.05622 (2019) - [i17]Mukund Sundararajan, Amir Najmi:
The many Shapley values for model explanation. CoRR abs/1908.08474 (2019) - 2018
- [j12]Shahar Dobzinski, Aranyak Mehta, Tim Roughgarden, Mukund Sundararajan:
Is Shapley cost sharing optimal? Games Econ. Behav. 108: 130-138 (2018) - [c30]Pramod Kaushik Mudrakarta, Ankur Taly, Mukund Sundararajan, Kedar Dhamdhere:
Did the Model Understand the Question? ACL (1) 2018: 1896-1906 - [c29]Matthias Ruhl, Mukund Sundararajan, Qiqi Yan:
The Cascading Analysts Algorithm. SIGMOD Conference 2018: 1083-1096 - [i16]Pramod Kaushik Mudrakarta, Ankur Taly, Mukund Sundararajan, Kedar Dhamdhere:
It was the training data pruning too! CoRR abs/1803.04579 (2018) - [i15]Pramod Kaushik Mudrakarta, Ankur Taly, Mukund Sundararajan, Kedar Dhamdhere:
Did the Model Understand the Question? CoRR abs/1805.05492 (2018) - [i14]Kedar Dhamdhere, Mukund Sundararajan, Qiqi Yan:
How Important Is a Neuron? CoRR abs/1805.12233 (2018) - [i13]Mukund Sundararajan, Ankur Taly:
A Note about: Local Explanation Methods for Deep Neural Networks lack Sensitivity to Parameter Values. CoRR abs/1806.04205 (2018) - 2017
- [c28]Mukund Sundararajan, Ankur Taly, Qiqi Yan:
Axiomatic Attribution for Deep Networks. ICML 2017: 3319-3328 - [c27]Kedar Dhamdhere, Kevin S. McCurley, Ralfi Nahmias, Mukund Sundararajan, Qiqi Yan:
Analyza: Exploring Data with Conversation. IUI 2017: 493-504 - [i12]Mukund Sundararajan, Ankur Taly, Qiqi Yan:
Axiomatic Attribution for Deep Networks. CoRR abs/1703.01365 (2017) - [i11]Matthias Ruhl, Mukund Sundararajan, Qiqi Yan:
Hierarchical Summarization of Metric Changes. CoRR abs/1703.07795 (2017) - [i10]Kedar Dhamdhere, Kevin S. McCurley, Mukund Sundararajan, Ankur Taly:
Abductive Matching in Question Answering. CoRR abs/1709.03036 (2017) - [i9]Mukund Sundararajan, Qiqi Yan:
A Simple and Efficient MapReduce Algorithm for Data Cube Materialization. CoRR abs/1709.10072 (2017) - 2016
- [j11]Mukund Sundararajan, Inbal Talgam-Cohen:
Prediction and Welfare in Ad Auctions. Theory Comput. Syst. 59(4): 664-682 (2016) - [j10]Mohammad Mahdian, Mukund Sundararajan:
Robust Mechanisms for Sponsored Search. EAI Endorsed Trans. Serious Games 3(10): e2 (2016) - [i8]Mukund Sundararajan, Ankur Taly, Qiqi Yan:
Gradients of Counterfactuals. CoRR abs/1611.02639 (2016) - 2014
- [j9]Krishnamurthy Iyer, Ramesh Johari, Mukund Sundararajan:
Mean Field Equilibria of Dynamic Auctions with Learning. Manag. Sci. 60(12): 2949-2970 (2014) - [c26]Mukund Sundararajan, Inbal Talgam-Cohen:
Prediction and Welfare in Ad Auctions. SAGT 2014: 267-278 - 2013
- [i7]Mukund Sundararajan, Inbal Talgam-Cohen:
Refine Predictions Ad Infinitum? CoRR abs/1302.6700 (2013) - 2012
- [j8]Arpita Ghosh, Tim Roughgarden, Mukund Sundararajan:
Universally Utility-maximizing Privacy Mechanisms. SIAM J. Comput. 41(6): 1673-1693 (2012) - [j7]Adam Barth, Benjamin I. P. Rubinstein, Mukund Sundararajan, John C. Mitchell, Dawn Song, Peter L. Bartlett:
A Learning-Based Approach to Reactive Security. IEEE Trans. Dependable Secur. Comput. 9(4): 482-493 (2012) - [j6]Shaddin Dughmi, Tim Roughgarden, Mukund Sundararajan:
Revenue Submodularity. Theory Comput. 8(1): 95-119 (2012) - [c25]Vahab S. Mirrokni, Sebastien Roch, Mukund Sundararajan:
On Fixed-Price Marketing for Goods with Positive Network Externalities. WINE 2012: 532-538 - 2011
- [j5]Krishnamurthy Iyer, Ramesh Johari, Mukund Sundararajan:
Mean field equilibria of dynamic auctions with learning. SIGecom Exch. 10(3): 10-14 (2011) - [c24]Krishnamurthy Iyer, Ramesh Johari, Mukund Sundararajan:
Mean field equilibria of dynamic auctions with learning: A dynamic revenue equivalence theorem. Allerton 2011: 1002-1003 - [c23]Yi Sun, Mukund Sundararajan:
Axiomatic attribution for multilinear functions. EC 2011: 177-178 - [c22]Krishnamurthy Iyer, Ramesh Johari, Mukund Sundararajan:
Mean field equilibria of dynamic auctions with learning. EC 2011: 339-340 - [i6]Yi Sun, Mukund Sundararajan:
Axiomatic Attribution for Multilinear Functions. CoRR abs/1102.0989 (2011) - 2010
- [c21]C. Lakshmi, M. Ponnavaikko, Mukund Sundararajan:
Improved Kernel Common Vector Method for Face Recognition Varying in Background Conditions. CompIMAGE 2010: 175-186 - [c20]Adam Barth, Benjamin I. P. Rubinstein, Mukund Sundararajan, John C. Mitchell, Dawn Song, Peter L. Bartlett:
A Learning-Based Approach to Reactive Security. Financial Cryptography 2010: 192-206 - [c19]Mangesh Gupte, Mukund Sundararajan:
Universally optimal privacy mechanisms for minimax agents. PODS 2010: 135-146 - [c18]Mukund Sundararajan, Qiqi Yan:
Robust mechanisms for risk-averse sellers. EC 2010: 139-148 - [i5]Mangesh Gupte, Mukund Sundararajan:
Universally Optimal Privacy Mechanisms for Minimax Agents. CoRR abs/1001.2767 (2010) - [i4]Mukund Sundararajan, Qiqi Yan:
Robust Mechanisms for Risk-Averse Sellers. CoRR abs/1002.2477 (2010)
2000 – 2009
- 2009
- [b1]Mukund Sundararajan:
Trade-offs in cost sharing. Stanford University, USA, 2009 - [j4]Aranyak Mehta, Tim Roughgarden, Mukund Sundararajan:
Beyond Moulin mechanisms. Games Econ. Behav. 67(1): 125-155 (2009) - [j3]Tim Roughgarden, Mukund Sundararajan:
Quantifying inefficiency in cost-sharing mechanisms. J. ACM 56(4): 23:1-23:33 (2009) - [j2]Mohammad S. Obaidat, Mukund Sundararajan:
New enhancements to the SOCKS communication network security protocol: Schemes and performance evaluation. J. Syst. Softw. 82(12): 1941-1949 (2009) - [c17]Shaddin Dughmi, Tim Roughgarden, Mukund Sundararajan:
Revenue Submodularity. AMMA 2009: 89-91 - [c16]Shaddin Dughmi, Tim Roughgarden, Mukund Sundararajan:
Revenue submodularity. EC 2009: 243-252 - [c15]Arpita Ghosh, Tim Roughgarden, Mukund Sundararajan:
Universally utility-maximizing privacy mechanisms. STOC 2009: 351-360 - [i3]Adam Barth, Benjamin I. P. Rubinstein, Mukund Sundararajan, John C. Mitchell, Dawn Xiaodong Song, Peter L. Bartlett:
A Learning-Based Approach to Reactive Security. CoRR abs/0912.1155 (2009) - 2008
- [c14]Jason Auerbach, Joel Galenson, Mukund Sundararajan:
An empirical analysis of return on investment maximization in sponsored search auctions. AdKDD@KDD 2008: 1-9 - [c13]Shahar Dobzinski, Aranyak Mehta, Tim Roughgarden, Mukund Sundararajan:
Is Shapley Cost Sharing Optimal? SAGT 2008: 327-336 - [c12]Mukund Sundararajan, Mohammad S. Obaidat:
New Techniques to Enhance the Capabilities of the Socks Network Security Protocol. SECRYPT 2008: 197-201 - [c11]Shahar Dobzinski, Mukund Sundararajan:
On characterizations of truthful mechanisms for combinatorial auctions and scheduling. EC 2008: 38-47 - [c10]Jason D. Hartline, Vahab S. Mirrokni, Mukund Sundararajan:
Optimal marketing strategies over social networks. WWW 2008: 189-198 - [c9]John C. Mitchell, Arnab Roy, Mukund Sundararajan:
An Automated Approach for Proving PCL Invariants. SecReT@LICS/CSF 2008: 93-113 - [i2]Arpita Ghosh, Tim Roughgarden, Mukund Sundararajan:
Universally Utility-Maximizing Privacy Mechanisms. CoRR abs/0811.2841 (2008) - 2007
- [j1]Samuel Ieong, Mukund Sundararajan, Anthony Man-Cho So:
Mechanism design for stochastic optimization problems. SIGecom Exch. 7(1): 52-54 (2007) - [c8]Tim Roughgarden, Mukund Sundararajan:
Optimal Efficiency Guarantees for Network Design Mechanisms. IPCO 2007: 469-483 - [c7]Aranyak Mehta, Tim Roughgarden, Mukund Sundararajan:
Beyond moulin mechanisms. EC 2007: 1-10 - [c6]Samuel Ieong, Anthony Man-Cho So, Mukund Sundararajan:
Stochastic Mechanism Design. WINE 2007: 269-280 - [c5]Arpita Ghosh, Hamid Nazerzadeh, Mukund Sundararajan:
Computing Optimal Bundles for Sponsored Search. WINE 2007: 576-583 - 2006
- [c4]Tim Roughgarden, Mukund Sundararajan:
New trade-offs in cost-sharing mechanisms. STOC 2006: 79-88 - [c3]Shuchi Chawla, Tim Roughgarden, Mukund Sundararajan:
Optimal Cost-Sharing Mechanisms for Steiner Forest Problems. WINE 2006: 112-123 - [i1]Tim Roughgarden, Mukund Sundararajan:
Approximately Efficient Cost-Sharing Mechanisms. CoRR abs/cs/0606127 (2006) - 2005
- [c2]Changhua He, Mukund Sundararajan, Anupam Datta, Ante Derek, John C. Mitchell:
A modular correctness proof of IEEE 802.11i and TLS. CCS 2005: 2-15 - 2004
- [c1]Mukund Sundararajan, Michael Brudno, Kerrin S. Small, Arend Sidow, Serafim Batzoglou:
Chaining Algorithms for Alignment of Draft Sequence. WABI 2004: 326-337
Coauthor Index
aka: Tim Roughgarden
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:09 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint