Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Kijung Jeon

dblp:420/2363 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2025
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Mathematical optimization · 67% Algorithms and data structures · 33%
Artificial intelligence
1 paper
Probabilistic and Bayesian machine learning · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Mathematical optimization
constrained sampling
0.912025
Fast Non-Log-Concave Sampling under Nonconvex Equality and Inequality Constraints with Landing · NeurIPS 2025
Mathematical optimization
langevin dynamics
0.912025
Fast Non-Log-Concave Sampling under Nonconvex Equality and Inequality Constraints with Landing · NeurIPS 2025
Algorithms and data structures › randomized algorithms
sampling
0.912025
Fast Non-Log-Concave Sampling under Nonconvex Equality and Inequality Constraints with Landing · NeurIPS 2025
Machine learning › Probabilistic and Bayesian machine learning › statistical inference
bayesian inference
0.312025
Fast Non-Log-Concave Sampling under Nonconvex Equality and Inequality Constraints with Landing · NeurIPS 2025

Methods — techniques the papers use, named apart from their topics

overdamped langevin dynamics · 1.7landing correction · 1.7
YearPublicationVenuePosition
2025 Fast Non-Log-Concave Sampling under Nonconvex Equality and Inequality Constraints with Landing
abstract
Sampling from constrained statistical distributions is a fundamental task in various fields including Bayesian statistics, computational chemistry, and statistical physics. This article considers the cases where the constrained distribution is described by an unconstrained density, as well as additional equality and/or inequality constraints, which often make the constraint set nonconvex. Existing methods for nonconvex constraint set $\Sigma \subset \mathbb{R}^d$ defined by equality or inequality constraints commonly rely on costly projection steps. Moreover, they cannot handle equality and inequality constraints simultaneously as each method only specialized in one case. In addition, rigorous and quantitative convergence guarantee is often lacking. In this paper, we introduce Overdamped Langevin with LAnding (OLLA), a new framework that can design overdamped Langevin dynamics accommodating both equality and inequality constraints. The proposed dynamics also deterministically corrects trajectories along the normal direction of the constraint surface, thus obviating the need for explicit projections. We show that, under suitable regularity conditions on the target density and $\Sigma$, OLLA converges exponentially fast in $W_2$ distance to the constrained target density $\rho_\Sigma(x) \propto \exp(-f(x))d\sigma_\Sigma$. Lastly, through experiments, we demonstrate the efficiency of OLLA compared to projection-based constrained Langevin algorithms and their slack variable variants, highlighting its favorable computational cost and reasonable empirical mixing.
Kijung Jeon, Michael Muehlebach, Molei Tao
NeurIPS1