default search action
Yunbum Kook
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c8]Yunbum Kook, Matthew Shunshi Zhang, Sinho Chewi, Murat A. Erdogdu, Mufan (Bill) Li:
Sampling from the Mean-Field Stationary Distribution. COLT 2024: 3099-3136 - [c7]Yunbum Kook, Santosh S. Vempala:
Gaussian Cooling and Dikin Walks: The Interior-Point Method for Logconcave Sampling. COLT 2024: 3137-3240 - [c6]Kwangjun Ahn, Zhiyu Zhang, Yunbum Kook, Yan Dai:
Understanding Adam Optimizer via Online Learning of Updates: Adam is FTRL in Disguise. ICML 2024 - [i11]Kwangjun Ahn, Zhiyu Zhang, Yunbum Kook, Yan Dai:
Understanding Adam Optimizer via Online Learning of Updates: Adam is FTRL in Disguise. CoRR abs/2402.01567 (2024) - [i10]Yunbum Kook, Matthew Shunshi Zhang, Sinho Chewi, Murat A. Erdogdu, Mufan Bill Li:
Sampling from the Mean-Field Stationary Distribution. CoRR abs/2402.07355 (2024) - [i9]Yunbum Kook, Santosh S. Vempala, Matthew Shunshi Zhang:
In-and-Out: Algorithmic Diffusion for Sampling Convex Bodies. CoRR abs/2405.01425 (2024) - [i8]Yunbum Kook, Matthew S. Zhang:
Rényi-infinity constrained sampling with d3 membership queries. CoRR abs/2407.12967 (2024) - [i7]Yunbum Kook, Matthew S. Zhang:
Covariance estimation using Markov chain Monte Carlo. CoRR abs/2410.17147 (2024) - 2023
- [c5]Yunbum Kook, Yin Tat Lee, Ruoqi Shen, Santosh S. Vempala:
Condition-number-independent Convergence Rate of Riemannian Hamiltonian Monte Carlo with Numerical Integrators. COLT 2023: 4504-4569 - [i6]Yunbum Kook, Santosh S. Vempala:
Efficiently Sampling the PSD Cone with the Metric Dikin Walk. CoRR abs/2307.12943 (2023) - 2022
- [j1]Jihoon Ko, Yunbum Kook, Kijung Shin
:
Growth patterns and models of real-world hypergraphs. Knowl. Inf. Syst. 64(11): 2883-2920 (2022) - [c4]Yunbum Kook, Yin Tat Lee, Ruoqi Shen, Santosh S. Vempala:
Sampling with Riemannian Hamiltonian Monte Carlo in a Constrained Space. NeurIPS 2022 - [i5]Yunbum Kook, Yin Tat Lee, Ruoqi Shen, Santosh S. Vempala:
Sampling with Riemannian Hamiltonian Monte Carlo in a Constrained Space. CoRR abs/2202.01908 (2022) - [i4]Yunbum Kook, Yin Tat Lee, Ruoqi Shen, Santosh S. Vempala:
Condition-number-independent Convergence Rate of Riemannian Hamiltonian Monte Carlo with Numerical Integrators. CoRR abs/2210.07219 (2022) - 2021
- [c3]Parinya Chalermsook, Syamantak Das, Yunbum Kook, Bundit Laekhanukit, Yang P. Liu, Richard Peng, Mark Sellke, Daniel Vaz:
Vertex Sparsification for Edge Connectivity. SODA 2021: 1206-1225 - 2020
- [c2]Yunbum Kook, Jihoon Ko, Kijung Shin:
Evolution of Real-world Hypergraphs: Patterns and Models without Oracles. ICDM 2020: 272-281 - [c1]Jihoon Ko, Yunbum Kook, Kijung Shin:
Incremental Lossless Graph Summarization. KDD 2020: 317-327 - [i3]Jihoon Ko, Yunbum Kook, Kijung Shin:
Incremental Lossless Graph Summarization. CoRR abs/2006.09935 (2020) - [i2]Parinya Chalermsook, Syamantak Das, Bundit Laekhanukit, Yunbum Kook, Yang P. Liu, Richard Peng, Mark Sellke, Daniel Vaz:
Vertex Sparsification for Edge Connectivity. CoRR abs/2007.07862 (2020) - [i1]Yunbum Kook, Jihoon Ko, Kijung Shin:
Evolution of Real-world Hypergraphs: Patterns and Models without Oracles. CoRR abs/2008.12729 (2020)
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-12-01 00:16 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: