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

3774110147 · May 202619922001200920172026
48 results for spectral contraction

Analyzes complex structure deformations using cohomology contraction methods.

problem Deforming complex structures and identifying obstructions.
method Refined power series method for (p,q)(p,q)-forms and complex structures, using Frölicher spectral sequence.
result All obstruction classes lie in the kernel of contraction maps under natural vanishing conditions.

In this paper we consider some insurance policies related to drawdown and drawup events of log-returns for an underlying asset modeled by a spectrally negative geometric Lévy process. We consider four contracts, three of which were introduced in Zhang et al. (2013) for a geometric Brownian motion. The first one is an i…

2017-01-07abs ↗pdf ↗

Bayesian framework for sphere regression using Gaussian fields.

problem Nonparametric regression on the sphere with Gaussian priors.
method Isotropic Gaussian field priors, harmonic structure, exact posterior distributions, optimal spectral truncation, posterior contraction rates.
result Sharp posterior contraction rates for Gaussian priors with polynomially decaying angular power spectra.

SpecGD mitigates misalignment in phase retrieval models with anisotropic inputs.

problem Misalignment during gradient descent in phase retrieval models with anisotropic inputs.
method Spectral gradient descent modifies gradient updates to preserve directional information and remove spike amplification.
result SpecGD removes spike amplification, leading to stable alignment and accelerated noise contraction.

Sharp comparison theorems are derived for all eigenvalues of the (weighted) Laplacian, for various classes of weighted-manifolds (i.e. Riemannian manifolds endowed with a smooth positive density). Examples include Euclidean space endowed with strongly log-concave and log-convex densities, extensions to pp-exponential …

2015-08-03abs ↗pdf ↗

Describes the relationship between two spectral sequences and their joint refinement.

problem Computing the cohomology of a group or space using spectral sequences.
method Joint tri-graded refinement of the Leray--Serre and Eilenberg--Moore spectral sequences.
result One of the spectral sequences always degenerates from its second page, and the other satisfies a local-to-global property.

Bayesian method improves predictions in overparameterized nonlinear regression.

problem Understanding overparameterization in nonlinear regression models.
method Bayesian framework with adaptive prior considering data spectral structure.
result Posterior contraction established for generalized linear and single-neuron models, demonstrating prediction consistency.

Recursive training of generative models can lead to model collapse, and the recursion converges to a unique limiting distribution.

problem Model collapse in recursive training of generative models
method Recursive training on their own outputs
result Recursive training converges to a unique limiting distribution

New insights explain why ββ-VAEs fail at disentanglement.

problem Disentanglement performance of ββ-VAEs peaks at intermediate ββ and collapses as regularization increases.
method Formalized information-theoretic mechanism, introduced λβλβ-VAE to stabilize disentanglement.
result Strong regularization pressure leads to mutual information collapse in ββ-VAEs.

This paper studies game-type credit default swaps that allow the protection buyer and seller to raise or reduce their respective positions once prior to default. This leads to the study of an optimal stopping game subject to early default termination. Under a structural credit risk model based on spectrally negative Le…

2011-05-02abs ↗pdf ↗

Defines Floer homology with DG coefficients for symplectic manifolds.

problem Computing Floer homology with DG coefficients for symplectic manifolds.
method Develops DG Floer toolset, defines spectral invariants, and proves Viterbo isomorphism theorem.
result Establishes almost existence of contractible periodic orbits on cotangent bundles.

This paper proves properties of uniformly hyperbolic sets and constructs Markov partitions.

problem Establishing properties of uniformly hyperbolic sets and constructing Markov partitions.
method Backward graph transform, spectral decomposition, shadowing lemma, Markov partitions construction.
result Explicit bounds and Hölder continuity for the coding map.

Study reveals learning curves and benign overfitting in spectral algorithms for large dimensions.

problem Understanding learning curves and benign overfitting in spectral algorithms for large-dimensional data.
method Analysis of learning curves and benign overfitting in spectral algorithms for inner-product kernels on the sphere and general domains.
result Characterization of three distinct regimes: over-regularized, under-regularized, and interpolation regimes, revealing benign overfitting across both under-regularized and interpolation regimes.

Bayesian method uses data spectra to estimate non-sparse high-dimensional models.

problem Handling many parameters in high-dimensional Bayesian statistics.
method Data-adaptive Gaussian prior aligned with leading eigenvectors of sample covariance.
result Posterior contraction rates reveal the effect of spectral mass on prediction error.

New gauge preserves Einstein metrics' interactions, proving rigidity on negatively curved manifolds.

problem Stability and deformation theory of Einstein metrics.
method Introduces Chen-Nagano gauge condition, linking Lichnerowicz Laplacian to shifted scalar operator.
result Chen-Nagano gauge collapses to classical transverse-traceless gauge under spectral pinching assumptions.

Deep networks learn clean structure before memorizing corrupted labels, leaving a spectral signature in gradient centered scatter.

problem Deep networks' transition from learning clean structure to memorizing corrupted labels under label noise.
method Analysis of the centered scatter of per-example last-layer gradients to identify Fisher Rank Inflation.
result Fisher Rank Inflation is a spectral signature of memorization under label noise, with effective rank expanding during memorization.

New defence against data-poisoning attacks in neural networks.

problem Data-poisoning attacks can evade existing defences and increase model efficacy.
method Proved geometric mechanism and identified near clone regime in input space.
result Regularisation and data augmentation reduce data fitting capacity and prevent poisoning.

The spectral geometry of mesh matrices of graphs is explored, leading to new formulas and eigenvalue estimates.

problem Understanding the spectral properties of mesh matrices of graphs.
method Definition and study of mesh matrices, introduction of mesh Laplacian, derivation of characteristic polynomial formulas.
result Mesh Laplacian eigenvalues are all real and greater than or equal to 1, with a smallest positive eigenvalue estimated.

The paper explores coalescent contractions in contractible spaces, providing criteria and examples.

problem Existence and absence of coalescent contractions in contractible spaces.
method Analysis of contractible finite simplicial complexes and criteria for coalescent contractions.
result Criteria for contractible finite simplicial complexes that ensure no coalescent contractions.

Method estimates shared and study-specific factors for multi-study data.

problem Covariance estimation for multi-study data with shared and study-specific components.
method Spectral decomposition for latent factors, surrogate Bayesian regressions for loadings and variances.
result Strong frequentist guarantees and superior performance in simulations and real data.

New method estimates covariance in multi-view data with better accuracy and uncertainty.

problem Estimating covariance in multi-view data with shared and view-specific latent factors.
method Spectral decompositions and conditional conjugate priors for factor loadings and residual variances.
result Proves favorable asymptotic properties and excellent performance in simulations and real data.

In an online contract selection problem there is a seller which offers a set of contracts to sequentially arriving buyers whose types are drawn from an unknown distribution. If there exists a profitable contract for the buyer in the offered set, i.e., a contract with payoff higher than the payoff of not accepting any c…

2013-05-15abs ↗pdf ↗

Optimal execution strategy for merger & acquisition contracts with price impact.

problem Optimal execution and pricing of financial derivatives in M&A deals.
method Indifference utility arguments, considering linear and nonlinear contracts.
result Linear contracts are more expensive and vulnerable to manipulation.

A lamination of a graph embedded on a surface is a collection of pairwise disjoint non-contractible simple closed curves drawn on the graph. In the case when the surface is a sphere with three punctures (a.k.a. a pair of pants), we first identify the lamination space of a graph embedded on that surface as a lattice pol…

2018-04-05abs ↗pdf ↗

This paper develops a method to select a reference contract for multi-contract quoting to minimize execution risk.

problem Minimizing execution risk in multi-contract quoting sequences.
method Develops a diagnostic framework using order-flow Hawkes forecasts and CLF to select a stable reference contract.
result Event-history and LOB-state signals offer complementary views for reference-contract selection.

We consider a general framework of optimal mechanism design under adverse selection and ambiguity about the type distribution of agents. We prove the existence of optimal mechanisms under minimal assumptions on the contract space and prove that centralized contracting implemented via mechanisms is equivalent to delegat…

2019-10-28abs ↗pdf ↗

Improved security of smart contracts by classifying them into four categories.

problem Detecting and classifying vulnerabilities in smart contracts efficiently.
method Used AWD-LSTM for multi-class classification, addressing class imbalance.
result Achieved a weighted average Fbeta score of 90.0%.

Study on contracting maps and their rigidity under curvature constraints.

problem Rigidity of contracting maps between manifolds with positive curvature.
method Analysis of curvature pinching and contracting conditions involving singular values.
result Established the relation between curvature pinching and contracting conditions.

We study locally compact contractive local groups, that is, locally compact local groups with a contractive pseudo-automorphism. We prove that if such an object is locally connected, then it is locally isomorphic to a Lie group. We also prove a related structure theorem for locally compact contractive local groups whic…

2009-09-24abs ↗pdf ↗

This paper presents some partial answers to the following question. QUESTION. If a normal space X is the union of an increasing sequence of open sets U(1), U(2), U(3) ... such that each U(n) contracts to a point in X, must X be contractible? The main results of the paper are: THEOREM 1. If a normal space X is the union…

2016-06-16abs ↗pdf ↗

Study on reinsurance decisions using mean-variance criterion with irreversible contracts.

problem Optimizing reinsurance premiums and contracts in a Stackelberg game with irreversible contracts.
method Unified singular control framework applied to both discrete and continuous time reinsurance contracts.
result A single once-for-all reinsurance contract is preferred over multiple contracts, and the signing time is crucial.

Optimal contracts help principals delegate data collection in decentralized ML.

problem Dealing with information asymmetries in decentralized ML.
method Design of optimal and near-optimal contracts addressing uncertainty in model quality and performance.
result Simple linear contracts achieve 1-1/e fraction of optimal utility.

Study efficient power iteration for tensor models, proving convergence under specific conditions.

problem Simultaneous alternating power iteration for fixed-order asymmetric rank-one spiked tensor models.
method Finite-iteration local theory, geometrically decaying transient, fixed-order multilinear noise event, warm-start mechanism.
result Convergence to the unique informative local fixed point under specific conditions.