![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Jun-Kun Wang
Person information
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
- [j1]Jun-Kun Wang
, Jacob D. Abernethy, Kfir Y. Levy:
No-regret dynamics in the Fenchel game: a unified framework for algorithmic convex optimization. Math. Program. 205(1): 203-268 (2024)
Conference and Workshop Papers
- 2023
- [c16]Jun-Kun Wang, Andre Wibisono:
Continuized Acceleration for Quasar Convex Functions in Non-Convex Optimization. ICLR 2023 - [c15]Jun-Kun Wang, Andre Wibisono:
Towards Understanding GD with Hard and Conjugate Pseudo-labels for Test-Time Adaptation. ICLR 2023 - [c14]Jun-Kun Wang, Andre Wibisono:
Accelerating Hamiltonian Monte Carlo via Chebyshev Integration Time. ICLR 2023 - 2022
- [c13]Jun-Kun Wang, Chi-Heng Lin, Andre Wibisono, Bin Hu:
Provable Acceleration of Heavy Ball beyond Quadratics for a Class of Polyak-Lojasiewicz Functions when the Non-Convexity is Averaged-Out. ICML 2022: 22839-22864 - 2021
- [c12]Jun-Kun Wang, Jacob D. Abernethy:
Understanding How Over-Parametrization Leads to Acceleration: A case of learning a single teacher neuron. ACML 2021: 17-32 - [c11]Jun-Kun Wang, Xiaoyun Li, Belhal Karimi, Ping Li:
An Optimistic Acceleration of AMSGrad for Nonconvex Optimization. ACML 2021: 422-437 - [c10]Jun-Kun Wang, Chi-Heng Lin, Jacob D. Abernethy:
A Modular Analysis of Provable Acceleration via Polyak's Momentum: Training a Wide ReLU Network and a Deep Linear Network. ICML 2021: 10816-10827 - 2020
- [c9]Jun-Kun Wang, Chi-Heng Lin, Jacob D. Abernethy:
Escaping Saddle Points Faster with Stochastic Momentum. ICLR 2020 - 2019
- [c8]Jarrid Rector-Brooks, Jun-Kun Wang, Barzan Mozafari:
Revisiting Projection-Free Optimization for Strongly Convex Constraint Sets. AAAI 2019: 1576-1583 - [c7]Jun-Kun Wang, Chi-Jen Lu, Shou-De Lin:
Online Linear Optimization with Sparsity Constraints. ALT 2019: 882-896 - 2018
- [c6]Jacob D. Abernethy, Kevin A. Lai, Kfir Y. Levy, Jun-Kun Wang:
Faster Rates for Convex-Concave Games. COLT 2018: 1595-1625 - [c5]Jun-Kun Wang, Jacob D. Abernethy:
Acceleration through Optimistic No-Regret Dynamics. NeurIPS 2018: 3828-3838 - 2017
- [c4]Jacob D. Abernethy, Jun-Kun Wang:
On Frank-Wolfe and Equilibrium Computation. NIPS 2017: 6584-6593 - 2016
- [c3]Jun-Kun Wang, Shou-De Lin:
Parallel Least-Squares Policy Iteration. DSAA 2016: 166-173 - [c2]Jun-Kun Wang, Shou-De Lin:
Efficient Sampling-Based ADMM for Distributed Data. DSAA 2016: 321-330 - 2014
- [c1]Jun-Kun Wang, Shou-de Lin:
Robust Inverse Covariance Estimation under Noisy Measurements. ICML 2014: 928-936
Informal and Other Publications
- 2023
- [i14]Jun-Kun Wang, Andre Wibisono:
Continuized Acceleration for Quasar Convex Functions in Non-Convex Optimization. CoRR abs/2302.07851 (2023) - 2022
- [i13]Jun-Kun Wang, Chi-Heng Lin, Andre Wibisono, Bin Hu:
Provable Acceleration of Heavy Ball beyond Quadratics for a Class of Polyak-Łojasiewicz Functions when the Non-Convexity is Averaged-Out. CoRR abs/2206.11872 (2022) - [i12]Jun-Kun Wang, Andre Wibisono:
Accelerating Hamiltonian Monte Carlo via Chebyshev Integration Time. CoRR abs/2207.02189 (2022) - [i11]Jun-Kun Wang, Andre Wibisono:
Towards Understanding GD with Hard and Conjugate Pseudo-labels for Test-Time Adaptation. CoRR abs/2210.10019 (2022) - 2021
- [i10]Jun-Kun Wang, Chi-Heng Lin, Jacob D. Abernethy:
Escaping Saddle Points Faster with Stochastic Momentum. CoRR abs/2106.02985 (2021) - [i9]Jun-Kun Wang:
Understanding Modern Techniques in Optimization: Frank-Wolfe, Nesterov's Momentum, and Polyak's Momentum. CoRR abs/2106.12923 (2021) - [i8]Jun-Kun Wang, Jacob D. Abernethy, Kfir Y. Levy:
No-Regret Dynamics in the Fenchel Game: A Unified Framework for Algorithmic Convex Optimization. CoRR abs/2111.11309 (2021) - 2020
- [i7]Jun-Kun Wang, Jacob D. Abernethy:
Quickly Finding a Benign Region via Heavy Ball Momentum in Non-Convex Optimization. CoRR abs/2010.01449 (2020) - [i6]Jun-Kun Wang, Jacob D. Abernethy:
Provable Acceleration of Neural Net Training via Polyak's Momentum. CoRR abs/2010.01618 (2020) - [i5]Jun-Kun Wang, Jacob D. Abernethy:
Understanding How Over-Parametrization Leads to Acceleration: A case of learning a single teacher neuron. CoRR abs/2010.01637 (2020) - 2019
- [i4]Jun-Kun Wang, Xiaoyun Li, Ping Li:
Optimistic Adaptive Acceleration for Optimization. CoRR abs/1903.01435 (2019) - 2018
- [i3]Jacob D. Abernethy, Kevin A. Lai
, Kfir Y. Levy, Jun-Kun Wang:
Faster Rates for Convex-Concave Games. CoRR abs/1805.06792 (2018) - [i2]Jun-Kun Wang, Jacob D. Abernethy:
Acceleration through Optimistic No-Regret Dynamics. CoRR abs/1807.10455 (2018) - [i1]Jarrid Rector-Brooks, Jun-Kun Wang, Barzan Mozafari:
Revisiting Projection-Free Optimization for Strongly Convex Constraint Sets. CoRR abs/1811.05831 (2018)
Coauthor Index
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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-07-25 19:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint