default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
- Amit Deshpande — disambiguation page
- Amit Deshpande 0001
Microsoft Research, Bangalore, India - Amit Deshpande 0002
Drexel University, College of Information Science and Technology, Philadelphia, USA - Amit Deshpande 0003
SAP Research, Palo Alto, USA
Likely matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 111 matches
- 2024
- Sandesh Kamath, Sankalp Mittal, Amit Deshpande, Vineeth N. Balasubramanian:
Rethinking Robustness of Model Attributions. AAAI 2024: 2688-2696 - Pragya Srivastava, Satvik Golechha, Amit Deshpande, Amit Sharma:
NICE: To Optimize In-Context Examples or Not? ACL (1) 2024: 5494-5510 - Mohit Sharma, Amit Deshpande:
How Far Can Fairness Constraints Help Recover From Biased Data? ICML 2024 - Sruthi Gorantla, Eshaan Bhansali, Amit Deshpande, Anand Louis:
Optimizing Learning-to-Rank Models for Ex-Post Fair Relevance. SIGIR 2024: 1525-1534 - Pragya Srivastava, Satvik Golechha, Amit Deshpande, Amit Sharma:
NICE: To Optimize In-Context Examples or Not? CoRR abs/2402.06733 (2024) - Sushant Agarwal, Amit Deshpande:
On the Power of Randomization in Fair Classification and Representation. CoRR abs/2406.03142 (2024) - 2023
- Amit Deshpande, Rameshwar Pratap:
One-Pass Additive-Error Subset Selection for ℓ p Subspace Approximation and (k, p)-Clustering. Algorithmica 85(10): 3144-3167 (2023) - Fred M. Abdelmalek, Priyavrat Deshpande, Shuchita Goyal, Amit Roy, Anurag Singh:
Chordal graphs, higher independence and vertex decomposable complexes. Int. J. Algebra Comput. 33(3): 481-498 (2023) - Sruthi Gorantla, Anay Mehrotra, Amit Deshpande, Anand Louis:
Sampling Individually-Fair Rankings that are Always Group Fair. AIES 2023: 205-216 - Atul Fegade, Rajesh Raut, Amruta Deshpande, Amit Mittal, Natashaa Kaul, Vandana Khanna:
Unleashing the Power of Generative Artificial Intelligence: Exploring its Boundless Potential and Overcoming Challenges in Academic Environments. IC3I 2023: 1243-1249 - Sruthi Gorantla, Amit Deshpande, Anand Louis:
Sampling Ex-Post Group-Fair Rankings. IJCAI 2023: 409-417 - Abhinav Kumar, Amit Deshpande, Amit Sharma:
Causal Effect Regularization: Automated Detection and Removal of Spurious Correlations. NeurIPS 2023 - Sruthi Gorantla, Kishen N. Gowda, Amit Deshpande, Anand Louis:
Socially Fair Center-Based and Linear Subspace Clustering. ECML/PKDD (1) 2023: 727-742 - Mohit Sharma, Amit Deshpande, Rajiv Ratn Shah:
On Testing and Comparing Fair classifiers under Data Bias. CoRR abs/2302.05906 (2023) - Abhinav Kumar, Amit Deshpande, Amit Sharma:
Causal Effect Regularization: Automated Detection and Removal of Spurious Attributes. CoRR abs/2306.11072 (2023) - Sruthi Gorantla, Anay Mehrotra, Amit Deshpande, Anand Louis:
Sampling Individually-Fair Rankings that are Always Group Fair. CoRR abs/2306.11964 (2023) - Sruthi Gorantla, Eshaan Bhansali, Amit Deshpande, Anand Louis:
Optimizing Group-Fair Plackett-Luce Ranking Models for Relevance and Ex-Post Fairness. CoRR abs/2308.13242 (2023) - Amit Deshpande, Rameshwar Pratap:
Improved Outlier Robust Seeding for k-means. CoRR abs/2309.02710 (2023) - Mohit Sharma, Amit Deshpande:
How Far Can Fairness Constraints Help Recover From Biased Data? CoRR abs/2312.10396 (2023) - Sandesh Kamath, Sankalp Mittal, Amit Deshpande, Vineeth N. Balasubramanian:
Rethinking Robustness of Model Attributions. CoRR abs/2312.10534 (2023) - 2022
- Kulin Shah, Amit Deshpande, Navin Goyal:
Learning and Generalization in Overparameterized Normalizing Flows. AISTATS 2022: 9430-9504 - Sandesh Kamath, Amit Deshpande, K. V. Subrahmanyam, Vineeth N. Balasubramanian:
Universalization of Any Adversarial Attack using Very Few Test Examples. COMAD/CODS 2022: 72-80 - Sushant Agarwal, Amit Deshpande:
On the Power of Randomization in Fair Classification and Representation. FAccT 2022: 1542-1551 - Rajesh Raut, Amruta Deshpande, Sugandh Arora, Amit Mittal, Rohit Alandikar:
An Examination of the Pricing of IPOs:The Indian Perspective. IC3I 2022: 155-159 - Amit Deshpande, Rameshwar Pratap:
One-Pass Additive-Error Subset Selection for ℓp Subspace Approximation. ICALP 2022: 51:1-51:14 - Sruthi Gorantla, Amit Deshpande, Anand Louis:
Sampling Random Group Fair Rankings. CoRR abs/2203.00887 (2022) - Amit Deshpande, Rameshwar Pratap:
One-pass additive-error subset selection for 𝓁p subspace approximation. CoRR abs/2204.12073 (2022) - Sruthi Gorantla, Kishen N. Gowda, Amit Deshpande, Anand Louis:
Socially Fair Center-based and Linear Subspace Clustering. CoRR abs/2208.10095 (2022) - Rasoul Shahsavarifar, Jithu Chandran, Mario Inchiosa, Amit Deshpande, Mario Schlener, Vishal Gossain, Yara Elias, Vinaya Murali:
Identifying, measuring, and mitigating individual unfairness for supervised learning models and application to credit risk models. CoRR abs/2211.06106 (2022) - 2021
- Amit Deshpande, Rameshwar Pratap:
Sampling-based dimension reduction for subspace approximation with outliers. Theor. Comput. Sci. 858: 100-113 (2021)
skipping 81 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-11-15 05:01 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint