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.

169,051 papers · 148 categories

Trend · papers per month

4283125166 · Jun 202019922001200920182026
48 results for perturbed sums

Proposes a new training algorithm for zero-sum games to avoid convergence issues.

problem Gradient-based training leads to weak convergence and cyclic dynamics in zero-sum architectures.
method Follow the perturbed leader algorithm with neural mediating agent.
result Guarantees convergence to mixed Nash equilibrium without cyclic behaviors.

A new method, Residual-Permuted Sums, improves confidence region construction for linear regression models.

problem Constructing reliable confidence regions for linear regression models with non-symmetric noise.
method Residual-Permuted Sums (RPS) method, which permutes residuals instead of perturbing their signs.
result RPS provides exact finite sample coverage probabilities and is uniformly strongly consistent.

We show that over the binary field F2\mathbb F_2, the Bar-Natan perturbation of Khovanov homology splits as the direct sum of its two reduced theories, which we also prove are isomorphic. This extends Shumakovitch's analogous result for ordinary Khovanov homology, without the perturbation.

2015-08-24abs ↗pdf ↗

We derive a gauge theoretic invariant of integral homology 3-spheres which counts gauge orbits of irreducible, perturbed flat SU(3) connections with sign given by spectral flow. To compensate for the dependence of this sum on perturbations, the invariant includes contributions from the reducible, perturbed flat orbits.…

1998-09-22abs ↗pdf ↗

The SPS method constructs confidence regions for true parameters with optimal sample complexity.

problem Constructing exact, non-asymptotic confidence regions for true system parameters.
method Sign-Perturbed Sums (SPS) method, generalized to various types of problems.
result High probability upper bounds for SPS confidence regions show optimal shrinkage rate.

This paper analyzes the sample complexity of SPS method for scalar linear regression.

problem Analyzing the sample complexity of the Sign-Perturbed Sums (SPS) identification method.
method The paper provides high probability upper bounds for the sizes of SPS confidence intervals under different sets of assumptions.
result The sizes of SPS confidence intervals shrink at a geometric rate around the true parameter, if observation noises are subgaussian.

A perturbative SU(3) Casson invariant ΛSU(3)(X)Λ_{SU(3)}(X) for integral homology 3-spheres is defined. Besides being fully perturbative, it has nice properties: (1) 4.ΛSU(3)(X)4 . Λ_{SU(3)}(X) is an integer. (2) It is preseved under orientation change. (3) A connected sum formula holds. Explicit calculations of the invariant for $1/k…

2000-06-02abs ↗pdf ↗

A method to learn robust policies for environments with model mismatches.

problem Training agents in high-stakes scenarios with mismatched training and real environments.
method Formalizes the perturbation as a zero-sum game to find Nash Equilibrium, which corresponds to the robust policy.
result Our algorithm can find a near-optimal robust policy with high probability using polynomial samples.

New method improves solving combinatorial optimization problems with smoothed policies.

problem Solving combinatorial optimization problems repeatedly with varying instances.
method Smoothed policies with controlled random perturbations to linear oracle, leading to differentiable surrogate risk.
result Generalization bound decomposes excess risk into bias, estimation, and optimization components.

New bounds for private matrix approximation using Gaussian noise and Dyson Brownian Motion.

problem Private approximation of symmetric matrices with Gaussian noise.
method Viewing Gaussian noise as Dyson Brownian Motion to track eigenvalue and eigenvector evolution.
result Improved bounds on Frobenius-distance utility for private matrix approximation.

A new game-theoretic approach to training robust classifiers against universal adversarial perturbations.

problem Learning classifiers robust to universal adversarial perturbations.
method Formulated as a two-player zero-sum game, where one player optimizes the classifier and the other creates adversarial perturbations.
result Empirically demonstrated robustness and versatility in multiple image classification datasets.

We show that the four derivative terms in the effective action of three-dimensional N=8 Yang-Mills theory are determined by supersymmetry. These terms receive both perturbative and non-perturbative corrections. Using our technique for constraining the effective action, we are able to determine the exact form of the eig…

1998-08-19abs ↗pdf ↗

SAMS-VAE models cellular perturbations using sparse additive mechanisms.

problem Modeling effects of diverse interventions on cells.
method Sparse Additive Mechanism Shift Variational Autoencoder (SAMS-VAE).
result SAMS-VAE identifies disentangled, perturbation-specific latent subspaces.

Gradient Descent Ascent converges to von-Neumann solution in hidden zero-sum games.

problem Understanding dynamics of zero-sum games with hidden structure.
method Gradient Descent Ascent applied to hidden zero-sum games with specific convex-concave structure.
result Gradient Descent Ascent converges to von-Neumann solution in strictly convex-concave hidden games.

We define string geometry: spaces of superstrings including the interactions, their topologies, charts, and metrics. Trajectories in asymptotic processes on a space of strings reproduce the right moduli space of the super Riemann surfaces in a target manifold. Based on the string geometry, we define Einstein-Hilbert ac…

2017-09-11abs ↗pdf ↗

We construct the Seiberg-Witten theory on 3-manifolds with Euclidean ends (connected sums of R3\R^3 and a compact manifold) with perturbations which approximate dx3*dx_3 at infinity, and describe the structure of the moduli spaces. The setup is inspired by Taubes's program of relating the 4-dimensional Seiberg-Witten in…

1997-06-24abs ↗pdf ↗

Given a smooth function f on R^n and a submanifold M, we prove that the set of diagonal quadratic forms q such that the restriction of f+q to M is Morse is a dense set (in the n-dimensional space of diagonal quadratic forms). The standard transversality argument seems not to work and we need a more refined approach.

2011-11-16abs ↗pdf ↗

The paper improves confidence ellipsoids for ridge regression with PAC bounds.

problem Uncertainty quantification in ridge regression for insufficiently exciting inputs.
method Extension of SPS EOA algorithm to ridge regression with PAC bounds.
result Explicitly shows how regularization parameter affects region sizes and provides tighter bounds.

Novel knot polynomials from Gaussian calculus show half vanish and determine Jones polynomials.

problem Understanding and characterizing knot polynomials from Gaussian calculus.
method Gaussian calculus of generating series for noncommutative algebras, connected sum of knots.
result Half of the polynomials vanish and three polynomials are explicitly given.

The gluing technique is used to construct hypersurfaces in Euclidean space having approximately constant prescribed mean curvature. These surfaces are perturbations of unions of finitely many spheres of the same radius assembled end-to-end along a line segment. The condition on the existence of these hypersurfaces is t…

2009-02-20abs ↗pdf ↗

The paper develops a method to create non-asymptotic confidence ellipsoids for linear regression without strong noise distribution assumptions.

problem Constructing reliable confidence regions for linear regression with finite sample sizes and general noise distributions.
method The paper introduces the SPS EOA algorithm to create non-asymptotically guaranteed confidence ellipsoids for linear regression problems.
result The sizes of SPS outer ellipsoids are shown to decrease at the optimal rate for linear regression problems.

A surgery on a knot in 3-sphere is called SU(2)-cyclic if it gives a manifold whose fundamental group has no non-cyclic SU(2) representations. Using holonomy perturbations on the Chern-Simons functional, we prove that the distance of two SU(2)-cyclic surgery coefficients is bounded by the sum of the absolute values of …

2013-06-29abs ↗pdf ↗

Assume (M,g,Ω) is a closed, oriented Riemannian surface equipped with an Anosov magnetic flow. We establish certain results on the surjectivity of the adjoint of the magnetic ray transform, and use these to prove the injectivity of the magnetic ray transform on sums of tensors of degree at most two. In the final sectio…

2012-08-29abs ↗pdf ↗

We define a homology theory of virtual links built out of the direct sum of the standard Khovanov complex with itself, motivating the name doubled Khovanov homology. We demonstrate that it can be used to show that some virtual links are non-classical, and that it yields a condition on a virtual knot being the connect s…

2017-04-24abs ↗pdf ↗

Quotients Y=X/conjY=X/conj by the complex conjugation conjXXconj\: X\to X for complex surfaces XX defined over R\R tend to be completely decomposable when they are simply connected, i.e., split into connected sums $\#_n CP^2\#_m\barCP^2$ if w2(Y)0w_2(Y)\ne0, or into #n(S2×S2)\#_n(S^2\times S^2) if w2(Y)=0w_2(Y)=0. The author proves this prope…

1995-12-11abs ↗pdf ↗

A robust method for multiple kernel learning against adversarial inputs.

problem Certifiably robust learning against adversarial perturbations.
method Distributionally robust optimization with min-max formulation and debiasing techniques.
result The method achieves theoretical guarantees and generalization bounds.

For a conformally compact manifold that is hyperbolic near infinity and of dimension n+1n+1, we complete the proof of the optimal O(rn+1)O(r^{n+1}) upper bound on the resonance counting function, correcting a mistake in the existing literature. In the case of a compactly supported perturbation of a hyperbolic manifold, we es…

2007-10-22abs ↗pdf ↗

Introduces RPU to explain randomization preference in dynamic settings.

problem Explains preference for randomization in dynamic investment problems.
method Introduces recursive perturbed utility (RPU) to incorporate randomization preference.
result Proves RPU-optimal portfolio policy is Gaussian and can be expressed in closed form.

The traceless SU(2)SU(2) character variety R(S2,{ai,bi}i=1n)R(S^2,\{a_i,b_i\}_{i=1}^n) of a 2n2n-punctured 2-sphere is the symplectic reduction of a Hamiltonian nn-torus action on the SU(2)SU(2) character variety of a closed surface of genus nn. It is stratified with a finite singular stratum and a top smooth symplectic stratum of dimens…

2015-11-01abs ↗pdf ↗

SSRGD finds local minima in nonconvex problems with simple gradient updates.

problem Finding local minima in nonconvex optimization problems.
method Simple perturbed stochastic recursive gradient descent (SSRGD).
result SSRGD finds (ε,δ)(ε,δ)-second-order stationary points efficiently.

New sigma models compute graviton scattering amplitudes from quaternionic geometry.

problem Computing graviton scattering amplitudes from quaternionic geometry.
method Introducing new twistor sigma models that encode finite non-linear perturbations of flat structures.
result Provides a first-principles derivation of Hodges' formula for MHV graviton amplitudes.

New aggregation method improves GNN robustness to structural perturbations.

problem Graph Neural Networks (GNNs) are vulnerable to adversarial attacks that manipulate graph structure.
method Proposes a robust aggregation function with a breakdown point of 0.5, inspired by robust statistics.
result Improves GNN robustness by a factor of 3 on Cora ML and 5.5 on Citeseer, and 8 for low-degree nodes.