default search action
Kevin A. Lai
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j2]Brian Bullins, Kevin A. Lai:
Higher-Order Methods for Convex-Concave Min-Max Optimization and Monotone Variational Inequalities. SIAM J. Optim. 32(3): 2208-2229 (2022) - 2021
- [c7]Jacob D. Abernethy, Kevin A. Lai, Andre Wibisono:
Last-Iterate Convergence Rates for Min-Max Optimization: Convergence of Hamiltonian Gradient Descent and Consensus Optimization. ALT 2021: 3-47 - [c6]Jacob D. Abernethy, Kevin A. Lai, Andre Wibisono:
Fast Convergence of Fictitious Play for Diagonal Payoff Matrices. SODA 2021: 1387-1404 - 2020
- [i9]Brian Bullins, Kevin A. Lai:
Higher-order methods for convex-concave min-max optimization and monotone variational inequalities. CoRR abs/2007.04528 (2020)
2010 – 2019
- 2019
- [i8]Jacob D. Abernethy, Kevin A. Lai, Andre Wibisono:
Last-iterate convergence rates for min-max optimization. CoRR abs/1906.02027 (2019) - [i7]Jacob D. Abernethy, Kevin A. Lai, Andre Wibisono:
Fictitious Play: Convergence, Smoothness, and Optimism. CoRR abs/1911.08418 (2019) - 2018
- [c5]Jacob D. Abernethy, Kevin A. Lai, Kfir Y. Levy, Jun-Kun Wang:
Faster Rates for Convex-Concave Games. COLT 2018: 1595-1625 - [c4]David Durfee, Kevin A. Lai, Saurabh Sawlani:
$\ell_1$ Regression using Lewis Weights Preconditioning and Stochastic Gradient Descent. COLT 2018: 1626-1656 - [c3]Rachel Cummings, Sara Krehbiel, Kevin A. Lai, Uthaipon Tao Tantipongpipat:
Differential Privacy for Growing Databases. NeurIPS 2018: 8878-8887 - [i6]Rachel Cummings, Sara Krehbiel, Kevin A. Lai
, Uthaipon Tantipongpipat:
Differential Privacy for Growing Databases. CoRR abs/1803.06416 (2018) - [i5]Jacob D. Abernethy, Kevin A. Lai
Faster Rates for Convex-Concave Games. CoRR abs/1805.06792 (2018) - 2017
- [i4]David Durfee, Kevin A. Lai
$\ell_1$ Regression using Lewis Weights Preconditioning. CoRR abs/1708.07821 (2017) - 2016
- [j1]Mahdi Amani
Amortized rotation cost in AVL trees. Inf. Process. Lett. 116(5): 327-330 (2016) - [c2]Kevin A. Lai, Anup B. Rao, Santosh S. Vempala:
Agnostic Estimation of Mean and Covariance. FOCS 2016: 665-674 - [i3]Kevin A. Lai
Agnostic Estimation of Mean and Covariance. CoRR abs/1604.06968 (2016) - 2015
- [c1]Pranjal Awasthi, Moses Charikar, Kevin A. Lai, Andrej Risteski:
Label optimal regret bounds for online local learning. COLT 2015: 150-166 - [i2]Pranjal Awasthi, Moses Charikar, Kevin A. Lai
Label optimal regret bounds for online local learning. CoRR abs/1503.02193 (2015) - [i1]Mahdi Amani, Kevin A. Lai, Robert Endre Tarjan:
Amortized Rotation Cost in AVL Trees. CoRR abs/1506.03528 (2015)
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-04-25 05:49 CEST 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: