Paper proposes a method to reduce hallucinations in diffusion models using Laplacian score sharpening.
problem Hallucinations in diffusion models create incoherent or unrealistic samples.
method Post-hoc adjustment to the score function during inference using Laplacian approximation.
result Significantly reduces the rate of hallucinated samples across various data types.
Proposes a symmetric graph autoencoder for unsupervised learning.
problem Graph representation learning without labeled data.
method Symmetric graph convolutional autoencoder with Laplacian sharpening and signed graphs.
result Outperforms state-of-the-art algorithms in clustering, link prediction, and visualization tasks.
SpecAE detects anomalies in attributed networks by projecting them into a tailored space.
problem Detecting anomalies in attributed networks with complex dependencies and nodal attributes.
method Spectral convolution and deconvolution framework, leveraging Laplacian sharpening and density estimation.
result SpecAE effectively detects global and community anomalies in attributed networks.
In the first part, we derive a sharp gradient estimate for the log of Dirichlet heat kernel and Poisson heat kernel on domains, and a sharpened local Li-Yau gradient estimate that matches the global one. In the second part, without explicit curvature assumptions, we prove a global upper bound for the fundamental soluti…
Proposes a flexible deep learning model for complex distributions.
problem Complex shapes, strong skews, and multiple modes in output variable distributions.
method Uncountable Mixture of Asymmetric Laplacians (UMAL) deep learning framework.
result UMAL can estimate heterogeneous distributions without strong assumptions.
The goal of the paper is to sharpen and generalise bounds involving the Cheeger's isoperimetric constant h and the first eigenvalue λ1 of the Laplacian. A celebrated lower bound of λ1 in terms of h, λ1≥h2/4, was proved by Cheeger in 1970 for smooth Riemannian manifolds. An upper bound on $λ_{1…
Self-improvement refines language models by verifying their own outputs.
problem Improving language models without external feedback.
method Formalizing self-improvement as sharpening, using the model itself as a verifier.
result RLHF-based self-improvement can outperform SFT-based methods.
Study inverse problems with measure samples, improving estimator calibration and recovery.
problem Inverse problems with unknown potentials observed through measure samples.
method Introduced convex empirical objectives and sharpened Fenchel--Young losses for finite-dimensional potential classes.
result High-probability parameter recovery bounds for inverse entropic unbalanced optimal transport and inverse JKO learning.
New approach ties loss curvature to model performance in deep learning.
problem Understanding the relationship between loss curvature and model performance in deep learning.
method Empirical analysis of loss Hessians and theoretical results on input-output Jacobians.
result Novel generalization bound in terms of empirical Jacobian.
Graph convolutions can enhance high frequencies, leading to over-sharpening.
problem Graph convolutions suffer from over-smoothing and poor performance on heterophilic graphs.
method Rigorously prove that linear graph convolutions minimize a generalized Dirichlet energy, showing that weight matrices induce edge-wise attraction or repulsion.
result Graph convolutions can enhance high frequencies, leading to over-sharpening instead of over-smoothing.
Study sharpens threshold for matching correlated graphs without labels.
problem Matching latent vertex correspondences in correlated random graphs.
method Analyzes information-theoretic limits for correct vertex matching in sub-sampled graphs.
result Establishes a sharp information-theoretic threshold for vertex matching recovery.
New theorem shows curvature concentration depends linearly on volume ratio.
problem Gap theorem for nonnegative Ricci curvature manifolds with small curvature concentration.
method Exhibited Ricci flow solution with faster than 1/t curvature decay.
result Curvature concentration depends linearly on asymptotic volume ratio.
This paper addresses Cheeger and Gromoll's question of which vector bundles admit a complete metric of nonnegative curvature, and relates their question to the issue of which sphere bundles admit a metric of positive curvature. We show that any vector bundle which admits a metric of nonnegative curvature must admit a c…
The paper sharpens inequalities in hyperbolic spaces.
problem Estimating hyperbolic capacities accurately.
method Detailed theorems establishing sharp capacitary inequalities.
result Established four types of sharp capacitary inequalities.
Detecting edge correlation between two graphs sharpens a threshold based on densest subgraph.
problem Detecting edge correlation between two Erdős-Rényi graphs.
method Formulated as a hypothesis testing problem, connecting to densest subgraph detection.
result Sharp information-theoretic threshold established for edge correlation detection.
We study the Gassner representation of the pure braid group Pn by considering its restriction to a free subgroup F. The kernel of the restriction is shown to lie in the subgroup [Γ3F,Γ2F], sharpening a result of Lipschutz.
We give tight concentration bounds for mixtures of martingales that are simultaneously uniform over (a) mixture distributions, in a PAC-Bayes sense; and (b) all finite times. These bounds are proved in terms of the martingale variance, extending classical Bernstein inequalities, and sharpening and simplifying prior wor…
We sharpen the construction of representation space in the paper "Principal Series Representations of Infinite Dimensional Lie Groups II: Construction of Induced Representations". We show that the principal series representation spaces constructed there, are completions of spaces of sections of Hilbert bundles rather t…
We give a new lower bound for the first gap λ2−λ1 of the Dirichlet eigenvalues of the Schr{ö}dinger operator on a bounded convex domain Ω in Rn or Sn and greatly sharpens the previous estimates. The new bound is explicit and computable.
The paper develops L2-Hodge theory on almost Kähler manifolds and proves the Hopf conjecture.
problem Proving the Hopf conjecture for almost Kähler manifolds.
method Developed L2-Hodge theory identities and applied them to prove vanishing theorems and refine estimates. result Proved the Hopf conjecture for compact almost Kähler manifolds with negative sectional curvature.
Cohen et al. (2021) show GD trajectories align on a bifurcation diagram.
problem Understanding the Edge of Stability (EoS) phenomenon in gradient descent.
method Empirical studies and rigorous mathematical proofs for two-layer networks and single-neuron networks.
result GD trajectories align on a specific bifurcation diagram independent of initialization.
In this work, complete constant mean curvature 1 (CMC-1) surfaces in hyperbolic 3-space with total absolute curvature at most 4 pi are classified. This classification suggests that the Cohn-Vossen inequality can be sharpened for surfaces with odd numbers of ends, and a proof of this is given.
We further sharpen higher type adjunction inequalities of P. Ozsváth and Z. Szabó on a 4-manifold M with a nonzero Seiberg-Witten invariant for a Spinc structure s, when an embedded surface Σ⊂M satisfies [Σ]⋅[Σ]≥0 and ∣⟨[Σ],c1(s)⟩∣+[Σ]⋅[Σ]≥2b1(M).
Improved Metropolized HMC mixing time with multi-step gradients.
problem Improving the efficiency of sampling from complex probability distributions.
method Analyzing Metropolized HMC with multi-step integrators and applying sharpening techniques.
result Non-asymptotic upper bound on mixing time for Metropolized HMC with explicit step-size and leapfrog steps.
Adversarial training makes logistic regression weight loss landscapes sharper.
problem Understanding why adversarial training sharpens the weight loss landscape in logistic regression.
method Theoretical analysis of linear logistic regression model with L2 norm constraints, and experiments on ResNet18.
result Adversarial training sharpens the weight loss landscape in linear logistic regression models.
From concentration inequalities for the suprema of Gaussian or Rademacher processes an inequality is derived. It is applied to sharpen existing and to derive novel bounds on the empirical Rademacher complexities of unit balls in various norms appearing in the context of structured sparsity and multitask dictionary lear…
Defines vector Laplacian on statistical manifolds.
problem No specific problem stated; focuses on mathematical definition.
method Defines and derives vector Laplacian formula.
result Derives formula for vector Laplacian.
Colding and Minicozzi have shown that an embedded minimal disk 0∈Σ⊂BR in $\Real^3$ with large curvature at 0 looks like a helicoid on the scale of R. Near 0, this can be sharpened: on the scale of ∣A∣−1(0), Σ is close, in a Lipschitz sense, to a piece of a helicoid. We use surfaces constructed by C…
NM-PPG optimizes adaptive feature acquisition in POMDPs for better predictions.
problem Optimizing adaptive feature acquisition in prediction problems with costly features.
method Non-myopic pathwise policy gradients (NM-PPG) with continuous relaxation and straight-through rollout.
result NM-PPG outperforms state-of-the-art AFA methods on synthetic and real-world datasets.
Given a data matrix X∈Rn×d and a response vector y∈Rn, suppose n>d, it costs O(nd2) time and O(nd) space to solve the least squares regression (LSR) problem. When n and d are both large, exactly solving the LSR problem is very expensive. When n≫d, one feasible approach to spee…
Quandle cocycle invariants form a powerful and well developed tool in knot theory. This paper treats their variations - namely, positive and twisted quandle cocycle invariants, and shadow invariants. We interpret the former as particular cases of the latter. As an application, several constructions from the shadow worl…
BIG Laplacians bridge combinatorial and Hodge Laplacians for discrete data.
problem Comparing combinatorial and Hodge Laplacians for discrete data.
method Introducing Boundary-Induced Graph (BIG) Laplacians using DEC.
result BIG Laplacian eigenvalues converge to Hodge Laplacian for simple shapes.
The study analyzes sharpness dynamics in neural networks, revealing mechanisms and conditions.
problem Understanding sharpness in neural network training.
method Fixed point analysis and edge of stability analysis in a simplified 2-layer linear network.
result Reveals mechanisms behind sharpness trends, conditions for edge of stability, and a period-doubling route to chaos.
In this paper we first give a one-move version of Markov's braid theorem for knot isotopy in S3 that sharpens the classical theorem. Then a relative version of Markov's theorem concerning a fixed braided portion in the knot. We also prove an analogue of Markov's theorem for knot isotopy in knot complements. Finally …
Paper introduces magnetic Hodge Laplacian for differential forms.
problem No specific problem stated; general spectral analysis of differential forms.
method Introduced magnetic Hodge Laplacian, discussed spectral results.
result Similarities and differences with magnetic Laplacian on functions.
A consequence of the Cabling Conjecture of Gonzalez-Acuña and Short is that Dehn surgery on a knot in S3 cannot produce a manifold with more than two connected summands. In the event that some Dehn surgery produces a manifold with three or more connected summands, then the surgery parameter is bounded in terms of th…
Weight decay stabilizes training dynamics by slowing progressive sharpening.
problem Understanding how weight decay affects training stability in deep learning models.
method Analyzing weight decay effects at the Edge of Stability, developing a mathematical framework.
result Weight decay dampens oscillations and stabilizes sharpness in CNNs, causing a phase transition in MLPs.
The paper extends Laplacian spectra approximations to vector bundles.
problem Approximating the spectrum of the connection Laplacian.
method Extending the graph connection Laplacian to vector bundles and proving spectrum approximation.
result The spectrum of the extended operator approximates the spectrum of the connection Laplacian.
Proves Laplacian and Lichnerowicz Laplacian are sectorial in weighted Hölder spaces.
problem Analyzing sectoriality of Laplacian and Lichnerowicz Laplacian on asymptotically hyperbolic spaces.
method Proves sectoriality in weighted Hölder spaces using asymptotically hyperbolic metrics.
result Analytic semigroups apply, yielding well-posedness results for parabolic evolution equations.
Survey of Laplacian-based methods for data dimensionality reduction and embedding.
problem Efficiently reducing high-dimensional data to lower dimensions while preserving important features and structures.
method Laplacian-based methods including spectral clustering, Laplacian eigenmap, locality preserving projection, graph embedding, and diffusion map.
result Comprehensive overview of various optimization variants and applications of Laplacian-based techniques.
The graph Laplacian plays key roles in information processing of relational data, and has analogies with the Laplacian in differential geometry. In this paper, we generalize the analogy between graph Laplacian and differential geometry to the hypergraph setting, and propose a novel hypergraph p-Laplacian. Unlike the …
The paper sets up eigenvalue comparison theorems for specific Laplacians on manifolds.
problem Eigenvalue comparison theorems for Witten-Laplacian and weighted p-Laplacian on manifolds with modified Ricci curvature. method Established Cheng-type eigenvalue comparison theorems for the first Dirichlet eigenvalues of the Witten-Laplacian and weighted p-Laplacian on geodesic balls. result Successfully set up eigenvalue comparison theorems for the Witten-Laplacian and weighted p-Laplacian. Extended bounds on small eigenvalues for pseudo-Laplacians on hyperbolic surfaces.
problem Bounding small eigenvalues of pseudo-Laplacians on hyperbolic surfaces.
method Extended Otal-Rosas bound and Colin de Verdière's spectral theory to hyperbolic surfaces with multiple cusps.
result Extended bounds on small eigenvalues for pseudo-Laplacians.
Paper investigates rigidity phenomena for weighted Ricci curvature bounds with Laplacian comparison theorem.
problem Investigating rigidity phenomena for weighted Ricci curvature bounds.
method Derived comparison geometric estimates and generalized for non-symmetric Laplacian.
result Obtained rigidity results for Laplacian comparison theorem, diameter comparisons, and volume comparisons.
Let T be the nilpotent group of 4 x 4 real upper triangular matrices. In this note we show that the Euler equations of certain left-invariant riemannian metrics on T have a horseshoe. We also show, with the aid of a numerical computation of a Melnikov-type integral, that the Euler equations of the sub-riemannian Carnot…
Study Hodge Laplacians for manifold data, improving error bounds.
problem Approximating Laplace-Beltrami operator on differential forms.
method Higher-order graph Laplacians (Hodge Laplacians) as approximations.
result High-probability error bound for Dirichlet forms.
Root Laplacian Eigenmaps help in spectral embedding of graphs.
problem Efficient spectral embedding of graphs.
method Square root of graph-Laplacian operator.
result Improved spectral embedding techniques.
New perspective on G2-structures flow from DeTurck Laplacian.
problem Understanding G2-structures and their flows.
method Introducing a new flow (DeTurck Laplacian flow) for G2-structures.
result DeTurck Laplacian flow is a flow of G2-structures.