default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNishant A. Mehta
Person information
- affiliation: Georgia Institute of Technology, College of Computing, Atlanta, GA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c20]Ali Mortazavi, Junhao Lin, Nishant A. Mehta:
On the price of exact truthfulness in incentive-compatible online learning with bandit feedback: a regret lower bound for WSU-UX. AISTATS 2024: 4681-4689- [c19]Bingshan Hu, Nishant A. Mehta:
Open Problem: Optimal Rates for Stochastic Decision-Theoretic Online Learning Under Differentially Privacy. COLT 2024: 5330-5334 - [i22]Quan Nguyen, Nishant A. Mehta:
Near-optimal Per-Action Regret Bounds for Sleeping Bandits. CoRR abs/2403.01315 (2024) - [i21]Ali Mortazavi, Junhao Lin, Nishant A. Mehta:
On the price of exact truthfulness in incentive-compatible online learning with bandit feedback: A regret lower bound for WSU-UX. CoRR abs/2404.05155 (2024) - [i20]Quan Nguyen, Nishant A. Mehta, Cristóbal Guzmán:
Beyond Minimax Rates in Group Distributionally Robust Optimization via a Novel Notion of Sparsity. CoRR abs/2410.00690 (2024) - 2023
- [c18]Nishant A. Mehta, Junpei Komiyama, Vamsi K. Potluru, Andrea Nguyen, Mica Grant-Hagen:
Thresholded linear bandits. AISTATS 2023: 6968-7020 - [c17]Quan Nguyen, Nishant A. Mehta:
Adversarial Online Multi-Task Reinforcement Learning. ALT 2023: 1124-1165 - [i19]Quan Nguyen, Nishant A. Mehta:
Adversarial Online Multi-Task Reinforcement Learning. CoRR abs/2301.04268 (2023) - [i18]Nishant A. Mehta:
An improved regret analysis for UCB-N and TS-N. CoRR abs/2305.04093 (2023) - 2021
- [c16]Cristóbal Guzmán, Nishant A. Mehta, Ali Mortazavi:
Best-case lower bounds in online learning. NeurIPS 2021: 21923-21934 - [i17]Bingshan Hu, Zhiming Huang, Nishant A. Mehta:
Optimal Algorithms for Private Online Learning in a Stochastic Environment. CoRR abs/2102.07929 (2021) - [i16]Cristóbal Guzmán, Nishant A. Mehta, Ali Mortazavi:
Best-Case Lower Bounds in Online Learning. CoRR abs/2106.12688 (2021) - 2020
- [j5]Peter D. Grünwald, Nishant A. Mehta:
Fast Rates for General Unbounded Loss Functions: From ERM to Generalized Bayes. J. Mach. Learn. Res. 21: 56:1-56:80 (2020) - [c15]Rianne de Heide, Alisa Kirichenko, Peter Grunwald, Nishant A. Mehta:
Safe-Bayesian Generalized Linear Regression. AISTATS 2020: 2623-2633 - [c14]Pon Kumar Sharoff, Nishant A. Mehta, Ravi Ganti:
A Farewell to Arms: Sequential Reward Maximization on a Budget with a Giving Up Option. AISTATS 2020: 3707-3716 - [i15]Pon Kumar Sharoff, Nishant A. Mehta, Ravi Ganti:
A Farewell to Arms: Sequential Reward Maximization on a Budget with a Giving Up Option. CoRR abs/2003.03456 (2020)
2010 – 2019
- 2019
- [c13]Rafael M. Frongillo, Nishant A. Mehta, Tom Morgan, Bo Waggoner:
Multi-Observation Regression. AISTATS 2019: 2691-2700 - [c12]Peter D. Grünwald, Nishant A. Mehta:
A tight excess risk bound via a unified PAC-Bayesian-Rademacher-Shtarkov-MDL complexity. ALT 2019: 433-465 - [c11]Bingshan Hu, Yunjin Chen, Zhiming Huang
, Nishant A. Mehta, Jianping Pan:
Intelligent Caching Algorithms in Heterogeneous Wireless Networks with Uncertainty. ICDCS 2019: 1549-1558 - [c10]Hamid Shayestehmanesh, Sajjad Azami, Nishant A. Mehta:
Dying Experts: Efficient Algorithms with Optimal Regret Bounds. NeurIPS 2019: 9983-9992 - [c9]Bingshan Hu, Nishant A. Mehta, Jianping Pan:
Problem-dependent Regret Bounds for Online Learning with Feedback Graphs. UAI 2019: 852-861 - [i14]Rianne de Heide, Alisa Kirichenko, Nishant A. Mehta, Peter Grünwald:
Safe-Bayesian Generalized Linear Regression. CoRR abs/1910.09227 (2019) - [i13]Hamid Shayestehmanesh, Sajjad Azami, Nishant A. Mehta:
Dying Experts: Efficient Algorithms with Optimal Regret Bounds. CoRR abs/1910.13521 (2019) - 2018
- [c8]Avery Hiebert, Cole Peterson, Alona Fyshe, Nishant A. Mehta:
Interpreting Word-Level Hidden State Behaviour of Character-Level LSTM Language Models. BlackboxNLP@EMNLP 2018: 258-266 - [i12]Rafael M. Frongillo, Nishant A. Mehta, Tom Morgan, Bo Waggoner:
Multi-Observation Regression. CoRR abs/1802.09680 (2018) - 2017
- [c7]Nishant A. Mehta:
Fast rates with high probability in exp-concave statistical learning. AISTATS 2017: 1085-1093 - [i11]Peter D. Grünwald, Nishant A. Mehta:
A Tight Excess Risk Bound via a Unified PAC-Bayesian-Rademacher-Shtarkov-MDL Complexity. CoRR abs/1710.07732 (2017) - 2016
- [i10]Peter D. Grünwald, Nishant A. Mehta:
Fast Rates with Unbounded Losses. CoRR abs/1605.00252 (2016) - [i9]Nishant A. Mehta:
From exp-concavity to variance control: O(1/n) rates and online-to-batch conversion with high probability. CoRR abs/1605.01288 (2016) - [i8]Nishant A. Mehta, Alistair P. Rendell, Anish Varghese, Christfried Webers:
CompAdaGrad: A Compressed, Complementary, Computationally-Efficient Adaptive Gradient Method. CoRR abs/1609.03319 (2016) - 2015
- [j4]Tim van Erven, Peter D. Grünwald, Nishant A. Mehta, Mark D. Reid, Robert C. Williamson:
Fast rates in statistical and online learning. J. Mach. Learn. Res. 16: 1793-1861 (2015) - [c6]Mark D. Reid, Rafael M. Frongillo, Robert C. Williamson, Nishant A. Mehta:
Generalized Mixability via Entropic Duality. COLT 2015: 1501-1522 - [i7]Tim van Erven, Peter D. Grünwald, Nishant A. Mehta, Mark D. Reid, Robert C. Williamson:
Fast rates in statistical and online learning. CoRR abs/1507.02592 (2015) - 2014
- [b1]Nishant A. Mehta:
On sparse representations and new meta-learning paradigms for representation learning. Georgia Institute of Technology, Atlanta, GA, USA, 2014 - [c5]Nishant A. Mehta, Robert C. Williamson:
From Stochastic Mixability to Fast Rates. NIPS 2014: 1197-1205 - [i6]Nishant A. Mehta, Robert C. Williamson:
From Stochastic Mixability to Fast Rates. CoRR abs/1406.3781 (2014) - [i5]Mark D. Reid, Rafael M. Frongillo, Robert C. Williamson, Nishant A. Mehta:
Generalized Mixability via Entropic Duality. CoRR abs/1406.6130 (2014) - 2013
- [j3]Ryan R. Curtin, James R. Cline, N. P. Slagle, William B. March, Parikshit Ram, Nishant A. Mehta, Alexander G. Gray:
MLPACK: a scalable C++ machine learning library. J. Mach. Learn. Res. 14(1): 801-805 (2013) - [c4]Nishant Ajay Mehta, Alexander G. Gray:
Sparsity-Based Generalization Bounds for Predictive Sparse Coding. ICML (1) 2013: 36-44 - 2012
- [j2]Jacqueline Fairley, George K. Georgoulas, Nishant A. Mehta, Alexander G. Gray, Donald L. Bliwise:
Computer detection approaches for the identification of phasic electromyographic (EMG) activity during human sleep. Biomed. Signal Process. Control. 7(6): 606-615 (2012) - [c3]Nishant A. Mehta, Dongryeol Lee, Alexander G. Gray:
Minimax Multi-Task Learning and a Generalized Loss-Compositional Paradigm for MTL. NIPS 2012: 2159-2167 - [i4]Nishant A. Mehta, Alexander G. Gray:
On the Sample Complexity of Predictive Sparse Coding. CoRR abs/1202.4050 (2012) - [i3]Nishant A. Mehta, Dongryeol Lee, Alexander G. Gray:
Minimax Multi-Task Learning and a Generalized Loss-Compositional Paradigm for MTL. CoRR abs/1209.2784 (2012) - [i2]Ryan R. Curtin, James R. Cline, N. P. Slagle, William B. March, Parikshit Ram, Nishant A. Mehta, Alexander G. Gray:
MLPACK: A Scalable C++ Machine Learning Library. CoRR abs/1210.6293 (2012) - 2011
- [j1]Nishant Ajay Mehta, Sadhir Hussain S. Hameed, Melody Moore Jackson:
Optimal Control Strategies for an SSVEP-Based Brain-Computer Interface. Int. J. Hum. Comput. Interact. 27(1): 85-101 (2011) - 2010
- [c2]Nishant Ajay Mehta, Thad Starner, Melody Moore Jackson, Karolyn O. Babalola, George Andrew James:
Recognizing Sign Language from Brain Imaging. ICPR 2010: 3842-3845 - [i1]Nishant A. Mehta, Alexander G. Gray:
Generative and Latent Mean Map Kernels. CoRR abs/1005.0188 (2010)
2000 – 2009
- 2009
- [c1]Nishant A. Mehta, Alexander G. Gray:
FuncICA for Time Series Pattern Discovery. SDM 2009: 73-84
Coauthor Index
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-11-06 20:30 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
