HMC achieves optimal convergence rate for strongly logconcave distributions.
problem Sampling from strongly logconcave densities efficiently.
method Hamiltonian Monte Carlo (HMC) with an optimal ODE solver.
result HMC achieves an optimal convergence rate of O(κ) for sampling from strongly logconcave distributions. Unified complexity bound for sampling logconcave distributions
problem Sampling arbitrary logconcave distributions
method In-and-Out algorithm with exponential lifting
result Nearly tight convergence rate
Improved Metropolized HMC runtime for logconcave distributions.
problem Improving the runtime of Metropolized HMC for logconcave sampling.
method Gradient norm concentration and new mixing time analysis techniques.
result Metropolized HMC mixes in O~(κd) iterations, improving runtime by a factor of (κ/d)1/2. New algorithm speeds up sampling from logconcave densities.
problem Sampling from logconcave functions in statistics and ML.
method Solves ODEs to improve HMC and other sampling methods.
result Nearly linear runtime for polylogarithmic depth.
Improves sampling, rounding, and integration of logconcave functions.
problem Sampling, rounding, and integration of logconcave functions.
method Algorithmic diffusion approach.
result First complexity improvements in nearly two decades for general logconcave functions.
Study sampling from logconcave distributions with dependent data streams.
problem Sampling from logconcave distributions with biased gradient estimates.
method Euler discretization of Langevin SDEs with dependent data.
result Upper bound on Wasserstein-2 distance between iterates and target distribution.
Faster algorithm for sampling logconcave densities in high dimensions.
problem Cubic barrier in sampling logconcave densities from a cold start.
method Two key ingredients: weaker distance sampling and refined log-Sobolev inequality.
result First sub-cubic sampling algorithms for isotropic position.
New algorithms sample structured logconcave families with improved efficiency.
problem Sampling structured logconcave families to high accuracy.
method Reduction framework inspired by proximal point methods, combined with restricted Gaussian oracles.
result Improved bounds for sampling structured distributions, matching or surpassing state-of-the-art results.
New method improves sampling from logconcave distributions truncated on polytopes.
problem Sampling from logconcave distributions with polytope constraints.
method Regularized Dikin walks, using Lewis weights.
result Improved mixing time guarantees for various distributions and polytopes.
Algorithm samples composite logconcave densities efficiently.
problem Sampling from composite logconcave densities efficiently.
method Uses a restricted Gaussian oracle and gradient queries.
result Achieves strong total variation distance guarantees.
MALA mixes efficiently under smoothness and isoperimetry assumptions.
problem Sampling from target densities efficiently.
method Metropolis-Adjusted Langevin algorithm (MALA) with smoothness and isoperimetry assumptions.
result MALA mixes in $O\left(\frac{(LΥ)^{\frac12}}{ψ_μ^2} \log\left(\frac{1}ε
ight)
ight)$ iterations.
Polynomial-time algorithm learns high-dimensional halfspaces without labels.
problem Learning high-dimensional halfspaces with margins in polynomial time.
method Contrastive moments and polynomial-time algorithm.
result Establishes the unique and efficient identifiability of the hidden halfspace.
New analysis for sampling from non-convex distributions with dependent data.
problem Sampling from non-logconcave distributions in stochastic optimization.
method Stochastic Gradient Langevin Dynamics (SGLD) with dependent data streams.
result Sharper and uniform convergence estimates in L1-Wasserstein distance. Improved bounds for MALA in non-convex sampling problems.
problem Sampling from non-convex distributions in high dimensions.
method Metropolis-adjusted Langevin algorithm (MALA) with improved bounds.
result MALA is faster than competitors in many challenging scenarios.
In this paper, we provide new insights on the Unadjusted Langevin Algorithm. We show that this method can be formulated as a first order optimization algorithm of an objective functional defined on the Wasserstein space of order 2. Using this interpretation and techniques borrowed from convex optimization, we give a …
New Langevin algorithm works well even for rough distributions.
problem Sampling from non-smooth distributions.
method Simple Langevin algorithm without smoothness assumptions.
result Algorithm performs well even with discontinuous gradients.
Links can be transformed into many others using a specific operation.
problem Understanding the relationship between strongly quasipositive links and their concordance.
method Used a satellite operation with a slice knot to transform links.
result Strongly quasipositive links can be transformed into infinitely many other links.
We define strongly Gauduchon spaces and the class SG which are generalization of strongly Gauduchon manifolds in complex spaces. Comparing with the case of Kahlerian, the strongly Gauduchon space and the class SG are similar to the Kahler space and the Fujiki class C respectively. Some properties about these complex sp…
New spacetimes found that are refocusing but not strongly refocusing.
problem Characterizing spacetimes that are refocusing but not strongly refocusing.
method Analyzing globally hyperbolic spacetimes and introducing new refocusing concepts.
result Existence of spacetimes that are refocusing but not strongly refocusing.
Study of strongly invertible Legendrian links in contact 3-space.
problem Characterizing and understanding strongly invertible Legendrian links.
method Equivariant analogs of basic results for strongly invertible and Legendrian links.
result Existence of maximal equivariant Thurston-Bennequin number for strongly invertible links.
In this paper, we study strongly Gauduchon metrics on compact complex manifolds. We study the cohomology cones SG in the de Rham cohomology groups generated by all strongly Gauduchon metrics and its direct images under proper modifications. We also study the moduli of strongly Gauduchon manifolds. We prove an existence…
We investigate refocusing and strong refocusing of light rays in a space-time. A strongly refocusing space-time is refocusing. The converse is unknown. We construct examples of space-times which are refocusing, but not strongly so, at a particular point. These space-times are strongly refocusing at other points. The ge…
Characterizes strongly quasipositive quasi-alternating and Montesinos links.
problem Characterizing strongly quasipositive links and detecting new classes of Montesinos links.
method Analyzing quasi-alternating links and their crossings, and using properties of Seifert surfaces.
result Strongly quasipositive links have specific properties related to their crossings and Seifert surfaces.
Strongly convex bodies can be approximated by smooth ones.
problem Approximating strongly convex bodies with smooth ones.
method Using C2 locally strongly convex bodies. result Smooth approximations of strongly convex bodies exist and can be controlled in terms of Hausdorff distance.
Study on invariant Seifert surfaces for strongly invertible knots, showing large gaps in genus.
problem Understanding gaps in genus between strongly invertible knots and their invariant Seifert surfaces.
method Analysis of invariant Seifert surfaces and proof of genus gaps, with variants of Edmonds' theorem.
result Gap between equivariant genus and usual genus can be arbitrarily large for strongly invertible knots.
Table of symmetric diagrams for knots up to 10 crossings.
problem Finding symmetric diagrams for strongly invertible knots.
method Compilation of symmetric diagrams for knots up to 10 crossings.
result Similarity of transversal diagrams to symmetric union diagrams for strongly invertible knots.
New algorithm proves most inflexible manifolds are not strongly inflexible.
problem Existence of simply-connected strongly inflexible manifolds.
method Algorithm based on Sullivan models.
result One example of simply-connected inflexible manifold is not strongly inflexible.
New examples of Howson groups that are not strongly Howson found.
problem Understanding the difference between Howson and strongly Howson groups.
method Constructing specific examples of groups to demonstrate the distinction.
result First examples of Howson groups that are not strongly Howson.
The paper simplifies strongly convex problems to simplicial structures.
problem Strongly convex problems with Cr smoothness. method Generic linear perturbations and singularity theory.
result Strongly convex C1 problems are C0 simplicial. Paper tackles sampling from non-log-concave distributions using denoising diffusion.
problem Sampling from non-log-concave distributions efficiently.
method DDMC framework, Zeroth-Order Diffusion Monte Carlo (ZOD-MC) algorithm.
result ZOD-MC achieves inverse polynomial dependence on sampling accuracy, efficient for low dimensions.
Develops equivariant grid homology for strongly invertible knots.
problem Invariants of strongly invertible knots.
method Equivariant grid diagrams and mapping cones.
result Equivariant unknotting numbers and genus bounds.
New findings on knot genera using advanced techniques.
problem Understanding the 4-genus of knots, especially strongly invertible and periodic ones.
method Innovative concordance group invariants, Donaldson's theorem, and g-signature.
result Many new examples showing the equivariant 4-genus is larger than the 4-genus.
The paper proves a Schwarz lemma for weakly Kähler-Finsler manifolds.
problem Estimating distance functions and proving Schwarz lemma for weakly Kähler-Finsler manifolds.
method Establishing theorems about distance functions and applying them to prove the Schwarz lemma.
result Holomorphic mappings from weakly Kähler-Finsler manifolds to pseudoconvex Finsler manifolds are constant under certain conditions.
Specialized knot theory theorems for strongly involutive links.
problem Classical Alexander and Markov theorems for links.
method Equivariant closure map for strongly involutive links.
result Surjective equivariant closure map up to equivalence of strongly involutive links.
A surface automorphism is strongly irreducible if every essential simple closed curve in the surface has nontrivial geometric intersection with its image. We show that a three-manifold admits only finitely many inequivalent surface bundle structures with strongly irreducible monodromy.
Study proves obstructions to equivariantly slice strongly negative amphichiral knots.
problem Proving obstructions for equivariantly slice strongly negative amphichiral knots.
method Using determinant, Spinc-structures, Donaldson's theorem, and Heegaard Floer correction terms.
result 8 out of 16 strongly negative amphichiral knots with 12 or fewer crossings are not equivariantly slice.
Defines knot signature invariant using G-signature theorem.
problem No specific problem stated; focuses on knot theory.
method Uses G-signature theorem to define knot invariant.
result Defines an invariant for strongly invertible knots.
The study classifies strongly irreducible Heegaard splittings in hyperbolic 3-manifolds.
problem Understanding the structure of Heegaard splittings in hyperbolic 3-manifolds.
method Effective version of Li's theorem applied to hyperbolic 3-manifolds, focusing on irreducible and strongly irreducible surfaces.
result Haken hyperbolic 3-manifolds have a finite collection of strongly irreducible Heegaard surfaces and incompressible surfaces, which classify all strongly irreducible Heegaard splittings.
In this paper we generalize the notion of strongly poly-free group to a larger class of groups, we call them strongly poly-surface groups and prove that the Fibered Isomorphism Conjecture of Farrell and Jones corresponding to the stable topological pseudoisotopy functor is true for any virtually strongly poly-surface g…
Injective map proven in knot Floer homology for strong homotopy-ribbon concordances.
problem Injectivity of knot Floer homology maps under strong homotopy-ribbon concordances.
method Knot Floer homology and properties of strongly homotopy-ribbon concordances.
result Injective map proven in knot Floer homology for strong homotopy-ribbon concordances.
Smooth families of biholomorphisms between strongly pseudoconvex domains are shown to be smooth.
problem Smoothness of families of biholomorphisms between strongly pseudoconvex domains.
method Riemannian geometry of Bergman metrics and smoothness of families of isometries.
result Smoothness of families of biholomorphisms between strongly pseudoconvex domains.
The paper defines new types of positivity and proves properties of Schur forms for vector bundles.
problem Defining and characterizing new types of positivity for vector bundles.
method Introducing and characterizing two types of strongly decomposable positivity, proving properties of Schur forms.
result Schur forms of strongly decomposable positive vector bundles are positive or weakly positive, answering a question of Griffiths.
Strongly polynomial algorithm for approximate Forster transforms and halfspace learning.
problem Computing approximate Forster transforms and halfspace learning.
method Strongly polynomial time algorithm for approximate Forster transforms and halfspace learning.
result First strongly polynomial time algorithm for distribution-free PAC learning of halfspaces.
We obtain an embedding theorem for compact strongly pseudoconvex CR manifolds which are bounadries of some complete Hermitian manifolds. We use this to compactify some negatively curved Kaehler manifolds with compact strongly pseudoconvex boundary. An embedding theorem for Sasakian manifolds is also derived.
In this paper, we prove that a strongly convex complex Finsler metric F on a domain D⊂Cn is projectively flat (resp. dually flat) if and only if F comes from a strongly convex complex Minkowski metric.
In Garside groups, axes of Morse elements are strongly contracting.
problem Understanding the dynamics of Morse elements in Garside groups.
method Analyzing the Cayley graph of Garside groups modulo their center, using Garside generators.
result Morse elements act loxodromically on the additional length graph of Garside groups.
Study identifies prime strongly positive amphicheiral knots with double symmetry.
problem Characterizing prime strongly positive amphicheiral knots with specific symmetries.
method Examined knots up to 16 crossings, identified prime knots with double symmetry, and presented almost doubly symmetric diagrams.
result Found the first prime strongly positive amphicheiral knot not slice.
The paper defines new geometric concepts on Riemannian manifolds and applies them to optimization problems.
problem Optimization problems on Riemannian manifolds.
method Strongly geodesic preinvexity, strongly η-invexity, and strongly invariant η-monotonicity definitions.
result Characterization of strict η-minimizers and solutions to variational like-inequality problems.