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

57114170227 · Jun 202019922001200920172026
48 results for residue currents

The paper develops residue currents for cohesive modules and proves a generalized Poincaré-Lelong formula.

problem Analyzing coherent sheaves on complex manifolds using global analytic methods.
method Developing residue currents for cohesive modules and proving their properties.
result Proves a generalized Poincaré-Lelong formula for cohesive modules.

Study the intersection of positive closed currents using tangent currents and King's residue formula.

problem Investigate the intersection of positive closed currents in complex manifolds.
method Employ tangent currents and King's residue formula to establish a natural condition for intersection.
result Derive an integral representation of the intersection of positive closed currents.

Fair market valuations ignore future worker profits in employee-owned firms.

problem Ignoring future worker profits in fair market valuations for employee-owned firms.
method Analyzing property rights and residual claimants in employee-owned firms.
result Fair market valuations are inappropriate for employee-owned firms.

Global Chern currents and Baum Bott currents defined on arbitrary complex manifolds.

problem Defining Chern classes and Baum Bott residues on complex manifolds without global resolutions.
method Combining Green's techniques with previous constructions to yield representatives of Chern classes and Baum Bott residues, using local resolutions and metrics.
result Transgression formula for the representatives, showing they differ by a current of the form dNdN.

Deviance Voronoi residuals improve earthquake insurance risk assessment.

problem Assessing earthquake insurance risk using spatio-temporal point process models.
method Extended Voronoi residuals and created simulation-based approach.
result Proposed formula for country-wide minimum capital test.

This paper aims at theoretically and empirically comparing two standard optimization criteria for Reinforcement Learning: i) maximization of the mean value and ii) minimization of the Bellman residual. For that purpose, we place ourselves in the framework of policy search algorithms, that are usually designed to maximi…

2016-06-24abs ↗pdf ↗

Subspace clustering aims to cluster unlabeled data that lies in a union of low-dimensional linear subspaces. Deep subspace clustering approaches based on auto-encoders have become very popular to solve subspace clustering problems. However, the training of current deep methods converges slowly, which is much less effic…

2019-10-12abs ↗pdf ↗

Second-order optimizers retain residual information after data deletion, affecting machine unlearning.

problem Residual information in second-order optimizers after data deletion.
method Comparison of first-order and second-order learners, eigendecomposition analysis.
result Second-order optimizers retain residual information, not detectable by first-order analysis.

Formula for sections on complex manifolds with non-isolated components.

problem Localization of sections on complex manifolds with non-isolated zero varieties.
method Logarithmic Bott localization formula, current-theoretic formulation.
result Established a formula for sections on compact complex manifolds with non-isolated components.

Adaptive weights improve physics-informed neural networks and deep operator networks.

problem Training physics-informed neural networks and deep operator networks can be challenging, leading to unsatisfactory accuracy and efficiency.
method Proposes a pointwise adaptive weighting method that balances the residual decay rate across different training points.
result Our proposed approach of balanced residual decay rates offers advantages including bounded weights, high prediction accuracy, fast convergence rate, low training uncertainty, low computational cost, and ease of hyperparameter tuning.

Gradient descent finds a global minimum in training deep neural networks despite the objective function being non-convex. The current paper proves gradient descent achieves zero training loss in polynomial time for a deep over-parameterized neural network with residual connections (ResNet). Our analysis relies on the p…

2018-11-09abs ↗pdf ↗

RSIC identifies multiple ranks of interest in NMF by analyzing residual sensitivity.

problem Determining the optimal rank in NMF.
method RSIC analyzes sensitivity of relative residuals to different initializations.
result RSIC identifies meaningful ranks consistent with data structure.

The paper introduces a diagnostic method to detect grokking transitions in models before test accuracy improves.

problem Detecting the transition from training to generalization in machine learning models.
method Summarize task-dependent observables as empirical distributions, map them to Wasserstein/quantile coordinates, and analyze using Hankel dynamic mode decomposition.
result The diagnostic method achieves AUROC \(\approx\) 0.93 for grokking-vs-non-grokking discrimination at the run level.

DAGR improves navigation by refining goal representations conditioned on the current state.

problem Goal-conditioned reinforcement learning lacks state awareness, leading to inefficient policy recovery.
method DAGR refines static goal embeddings into state-conditioned ones using gated cross-attention with a state-goal discrepancy map.
result DAGR improves navigation tasks on OGBench, matching or outperforming base methods.

DAS-PINNs uses deep learning to solve complex PDEs more accurately.

problem Solving high-dimensional PDEs with high accuracy.
method Deep neural networks and generative models for adaptive sampling.
result DAS-PINNs significantly improves solution accuracy for low regularity and high-dimensional problems.

The study shows that certain metrics on spheres prevent stable tangent cones for area-minimizing boundaries.

problem Preventing stable tangent cones for area-minimizing boundaries under specific metrics.
method Developed a perturbation theorem and used spectral theory and compactness arguments.
result A residual set of metrics on Sn+1S^{n+1} precludes linearly stable tangent cones for area-minimizing boundaries.

Residual neural networks improve collision prediction in planetary simulations.

problem Accurate prediction of planetary collisions in N-body simulations.
method Residual neural networks trained on collision data.
result Residual neural networks outperform existing methods in prediction accuracy and generalization.

The effective application of neural networks in the real-world relies on proficiently detecting out-of-distribution examples. Contemporary methods seek to model the distribution of feature activations in the training data for adequately distinguishing abnormalities, and the state-of-the-art method uses Gaussian distrib…

2020-01-15abs ↗pdf ↗

We seek to learn an effective policy for a Markov Decision Process (MDP) with continuous states via Q-Learning. Given a set of basis functions over state action pairs we search for a corresponding set of linear weights that minimizes the mean Bellman residual. Our algorithm uses a Kalman filter model to estimate those …

2013-09-26abs ↗pdf ↗

This paper improves Thompson Sampling for complex decision-making problems.

problem Learning in infinite-horizon discounted decision processes with unknown parameters.
method Developed a general canonical probability space and new metrics for analyzing adaptive learning algorithms.
result Thompson Sampling achieves complete learning in complex decision-making problems.

Federated learning is a distributed machine learning framework which enables different parties to collaboratively train a model while protecting data privacy and security. Due to model complexity, network unreliability and connection in-stability, communication cost has became a major bottleneck for applying federated …

2020-01-23abs ↗pdf ↗

Residual finiteness is known to be an important property of groups appearing in combinatorial group theory and low dimensional topology. In a recent work [2] residual finiteness of quandles was introduced, and it was proved that free quandles and knot quandles are residually finite. In this paper, we extend these resul…

2019-02-08abs ↗pdf ↗

In this note, residual finiteness of quandles is defined and investigated. It is proved that free quandles and knot quandles of tame knots are residually finite and Hopfian. Residual finiteness of quandles arising from residually finite groups (conjugation, core and Alexander quandles) is established. Further, residual…

2018-05-19abs ↗pdf ↗

This note announces a general construction of characteristic currents for singular connections on a vector bundle. It develops, in particular, a Chern-Weil-Simons theory for smooth bundle maps α:EFα: E \rightarrow F which, for smooth connections on EE and FF, establishes formulas of the type $$ φ\ = \ \text{\rm Res}_φΣ…

1994-07-01abs ↗pdf ↗

MGDL refines deep neural networks by training grades sequentially, improving stability.

problem Training deep neural networks is challenging due to nonconvex optimization landscapes.
method MGDL trains deep networks grade by grade, freezing previously learned grades and training new ones to fit residuals.
result MGDL guarantees vanishing error in a fixed-width multigrade ReLU architecture.

Unified physics-informed learning method improves generalization performance.

problem Lack of theoretical analysis for hybrid settings with incomplete physical constraints.
method Unified residual form unifying collocation and variational methods, establishing generalization performance governed by affine variety dimension.
result Generalization performance is determined by affine variety dimension, not just the number of parameters.

Researchers identify critical protein residues using advanced graph theory.

problem Identifying essential residues in proteins for function.
method Learning Random Geometric Graphs (RGG) with Cramer's V correlation and organic thresholding.
result Advanced RGG methods accurately identify critical residues compared to existing techniques.

Defines Wodzicki residue using groupoids and fibered distributions.

problem Defining and understanding the Wodzicki residue in noncommutative geometry.
method Using groupoid language and filtered manifolds, defining the residue and showing its properties.
result The groupoidal residue is a trace on pseudodifferential operators and matches the usual residue in certain cases.

In this work we prove a Baum-Bott type residue theorem for flags of holomorphic foliations. We prove some relations between the residues of the flag and the residues of their correspondent foliations. We define the Nash residue for flags and we give a partial answer to the Baum-Bott type rationality conjecture in this …

2016-02-29abs ↗pdf ↗

We revisit residual algorithms in both model-free and model-based reinforcement learning settings. We propose the bidirectional target network technique to stabilize residual algorithms, yielding a residual version of DDPG that significantly outperforms vanilla DDPG in the DeepMind Control Suite benchmark. Moreover, we…

2019-05-03abs ↗pdf ↗