Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

2579 · May 202619922001200920172026
48 results for sharpening

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.

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.

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.

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.

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 PnP_n by considering its restriction to a free subgroup FF. The kernel of the restriction is shown to lie in the subgroup [Γ3F,Γ2F][Γ^3 F,Γ^2 F], sharpening a result of Lipschutz.

2004-03-26abs ↗pdf ↗

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…

2015-06-22abs ↗pdf ↗

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…

2012-10-19abs ↗pdf ↗

We give a new lower bound for the first gap λ2λ1λ_2 - λ_1 of the Dirichlet eigenvalues of the Schr{ö}dinger operator on a bounded convex domain ΩΩ in Rn^n or Sn^n and greatly sharpens the previous estimates. The new bound is explicit and computable.

2004-04-22abs ↗pdf ↗

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.

We further sharpen higher type adjunction inequalities of P. Ozsváth and Z. Szabó on a 4-manifold MM with a nonzero Seiberg-Witten invariant for a Spinc^c structure s\frak{s}, when an embedded surface ΣMΣ\subset M satisfies [Σ][Σ]0[Σ]\cdot [Σ]\geq 0 and [Σ],c1(s)+[Σ][Σ]2b1(M).|\langle [Σ],c_1(\frak{s})\rangle|+[Σ]\cdot [Σ]\geq 2b_1(M).

2014-06-17abs ↗pdf ↗

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.

Colding and Minicozzi have shown that an embedded minimal disk 0ΣBR0\inΣ\subset B_R in $\Real^3$ with large curvature at 0 looks like a helicoid on the scale of RR. Near 0, this can be sharpened: on the scale of A1(0)|A|^{-1}(0), ΣΣ is close, in a Lipschitz sense, to a piece of a helicoid. We use surfaces constructed by C…

2008-05-30abs ↗pdf ↗

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 XRn×dX \in R^{n\times d} and a response vector yRny \in R^{n}, suppose n>dn>d, it costs O(nd2)O(n d^2) time and O(nd)O(n d) space to solve the least squares regression (LSR) problem. When nn and dd are both large, exactly solving the LSR problem is very expensive. When ndn \gg d, one feasible approach to spee…

2014-03-30abs ↗pdf ↗

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 S3S^3 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 …

2004-05-26abs ↗pdf ↗

A consequence of the Cabling Conjecture of Gonzalez-Acuña and Short is that Dehn surgery on a knot in S3S^3 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…

2009-08-19abs ↗pdf ↗

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.

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…

2007-09-28abs ↗pdf ↗

In \cite{CM5}, Colding and Minicozzi describe a type of compactness property possessed by sequences of embedded minimal surfaces in $\Real^3$ with finite genus and with boundaries going to \infty. They show that any such sequence either contains a sub-sequence with uniformly bounded curvature or the sub-sequence has …

2009-07-03abs ↗pdf ↗

We construct a simple topological invariant of certain 3-manifolds, including quotients of the 3-sphere by finite groups, based on the fact that the tangent bundle of an orientable 3-manifold is trivialisable. This invariant is strong enough to yield the classification of lens spaces of odd, prime order. We also use pr…

2001-03-27abs ↗pdf ↗

Paper sharpens inequality linking curvature and spectrum on manifolds.

problem Linking scalar curvature and the bottom spectrum on complete manifolds.
method Using deformed Dirac operators and relative A^\widehat{A}-cowaist.
result Established a sharp inequality between scalar curvature and the bottom spectrum.

Study pro-pp completions of orientable PD_n groups, proving best results in three cases.

problem Understanding pro-pp completions of orientable PD_n groups.
method Examined four cases of orientable PD_3-groups and some PD_n groups (n≤5), providing examples and proving best results in three cases.
result Best results in three out of four cases of orientable PD_3-groups.

Study sharpens unlinking number bounds for special alternating links.

problem Determining the exact unlinking number for special alternating links.
method Analyzes links in the 3-sphere, focusing on special alternating links and their crossing changes.
result Sharp lower bounds for unlinking number realized by crossing changes in alternating diagrams.

New bounds improve generalization in learning scenarios.

problem Limitations of existing information-theoretic bounds in SCO problems.
method Sample-conditioned hypothesis stability and neighboring-hypothesis matrix.
result Sharper generalization guarantees in various learning scenarios.

We show that the blowup of an extremal Kahler manifold at a relatively stable point in the sense of GIT admits an extremal metric in Kahler classes that make the exceptional divisor sufficiently small, extending a result of Arezzo-Pacard-Singer. We also study the K-polystability of these blowups, sharpening a result of…

2010-10-25abs ↗pdf ↗

Compactness theorems for G2G_2-solitons established with scalar curvature and potential function constraints.

problem Establishing compactness theorems for G2G_2-solitons under specific conditions.
method Proved Gromov-Hausdorff convergence and derived epsilon-regularity estimates.
result Smooth convergence of G2G_2-solitons under uniform energy bounds at half the dimension.

Outliers with opposing signals significantly affect neural network optimization.

problem Understanding and mitigating the impact of outliers with opposing signals on neural network training.
method Identifying and analyzing pairs of outliers with strong opposing signals in training data.
result Outliers with opposing signals can cause optimization to enter a narrow valley, leading to oscillatory behavior and eventual loss spikes.