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

2565127681,024 · Jun 202019922001200920172026
48 results for residual generation

Wide residual networks generalize well with uniform convergence to RNTK as width increases.

problem Understanding the generalization ability of wide residual networks.
method Uniform convergence of residual network kernel to residual neural tangent kernel (RNTK).
result Generalization error converges to kernel regression error with respect to RNTK.

Defines and proves generalized noncommutative residue theorems for specific dimensions.

problem Defining and proving residue theorems for noncommutative geometry.
method Defined generalized noncommutative residue of Dirac operator; proved Kastler-Kalau-Walze type theorems.
result Validated Kastler-Kalau-Walze type theorems for 4D and 6D compact manifolds.

Given a prime pp, a group is called residually pp if the intersection of its pp-power index normal subgroups is trivial. A group is called virtually residually pp if it has a finite index subgroup which is residually pp. It is well-known that finitely generated linear groups over fields of characteristic zero are …

2010-04-21abs ↗pdf ↗

Study on endomorphism and automorphism groups of specific quandles.

problem Characterizing endomorphism and automorphism groups of residually finite and profinite quandles.
method Proved properties of endomorphism monoids and automorphism groups for residually finite and profinite quandles.
result Endomorphism and automorphism groups of residually finite quandles are residually finite.

Generalization bounds derived for neural ODEs and deep residual networks.

problem Understanding the generalization capability of neural ODEs and deep residual networks.
method Lipschitz-based argument and analogy with deep residual networks.
result A generalization bound involving the magnitude of weight matrix differences.

Proves Singer conjecture for graph manifolds with residually finite groups.

problem Proving the Singer conjecture for graph manifolds with specific properties.
method Used residual finiteness and graph manifold properties to prove the conjecture.
result Proved the Singer conjecture for extended graph manifolds and pure complex-hyperbolic higher graph manifolds.

Study of uncountable family of finitely generated groups.

problem Characterize a family of finitely generated residually finite groups.
method Examined groups of the form F2HF2F_2*_H F_2 where F2F_2 is a rank-2 free group and HH is an infinitely generated subgroup.
result Unveiled uncountable family of groups up to isomorphism.

Alpha-based performance evaluation may fail to capture correlated residuals due to model errors. This paper proposes using the Generalized Information Ratio (GIR) to measure performance under misspecified benchmarks. Motivated by the theoretical link between abnormal returns and residual covariance matrix, GIR is deriv…

2018-03-04abs ↗pdf ↗

The paper derives spectral (0,4)-tensor functionals using the noncommutative residue.

problem Deriving spectral (0,4)-tensor functionals on compact spin manifolds.
method Using four one-forms and the Dirac operator, the noncommutative residue is applied to even-dimensional compact spin manifolds.
result Spectral (0,4)-tensor functionals are extended to a general spectral triple.

Classifies connected components of meromorphic differentials with residue conditions.

problem Understanding the structure of meromorphic differentials with residue constraints.
method Analyzes the multi-scale compactification and residue conditions.
result Classified connected components of generalized strata of meromorphic differentials.

Residual connections significantly boost the performance of deep neural networks. However, there are few theoretical results that address the influence of residuals on the hypothesis complexity and the generalization ability of deep neural networks. This paper studies the influence of residual connections on the hypoth…

2019-04-02abs ↗pdf ↗

The paper studies residues of manifolds and their applications in geometry.

problem Understanding the residues of manifolds and their geometric implications.
method Analytic continuation and Möbius invariance of residues, introduction of relative and weighted residues.
result Scalar curvature, mean curvature, and Euler characteristic can be expressed in terms of residues.

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.

Flow-based generative models parameterize probability distributions through an invertible transformation and can be trained by maximum likelihood. Invertible residual networks provide a flexible family of transformations where only Lipschitz conditions rather than strict architectural constraints are needed for enforci…

2019-06-06abs ↗pdf ↗

We generalize Luck's Theorem to show that the L^2-Betti numbers of a residually amenable covering space are the limit of the L^2-Betti numbers of a sequence of amenable covering spaces. We show that any residually amenable covering space of a finite simplicial complex is of determinant class, and that the L^2 torsion i…

1997-10-03abs ↗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 ↗

The fundamental n-quandles of links are residually finite for n ≥ 2.

problem Residual finiteness of fundamental n-quandles of oriented links.
method Investigation of residual finiteness and subquandle separability of quandles; use of Winker's work on 3-sphere branched covers.
result Fundamental n-quandles of oriented links are residually finite for each n ≥ 2.

Groups with similar pro-pp completions have two-generated subgroups that are free.

problem Understanding the profinite rigidity of groups with specific pro-pp completions.
method Utilizing new results on residually-(torsion-free nilpotent) groups and their subgroups, and applying these to prove profinite rigidity.
result Groups with the same pro-pp completion have two-generated subgroups that are free.

Study on residual Monge-Ampère mass for symmetric plurisubharmonic functions.

problem Analyzing the residual Monge-Ampère mass of symmetric plurisubharmonic functions.
method Proved zero mass for functions with zero Lelong number at origin and S1S^1-invariance.
result Zero mass conjecture answered for symmetric functions.

The study examines Hopfian properties of conjugation quandles and their underlying groups.

problem Understanding the relationship between Hopfian properties of conjugation quandles and their underlying groups.
method Examined Hopfian and residual finiteness properties of conjugation quandles of specific groups.
result Conjugation quandles of Baumslag-Solitar groups are infinitely generated and not necessarily Hopfian.

The covariance matrix is formulated in the framework of a linear multivariate ARCH process with long memory, where the natural cross product structure of the covariance is generalized by adding two linear terms with their respective parameter. The residuals of the linear ARCH process are computed using historical data …

2009-03-09abs ↗pdf ↗

Residual neural networks don't help overcome sampling complexity issues.

problem Learning invertible residual neural networks from samples is hard due to the curse of dimensionality.
method Investigated invertible residual neural networks and their sampling complexity.
result Invertible residual neural networks still suffer from the curse of dimensionality in sampling complexity.

We show that there is no algorithm deciding whether the maximal residually free quotient of a given finitely presented group is finitely presentable or not. Given a finitely generated subgroup G of a finite product of limit groups, we discuss the possibility of finding an explicit set of defining equations (i.e. of exp…

2009-02-12abs ↗pdf ↗

Extends spectral Einstein functionals computation to 4D spin manifolds with boundary.

problem Computing spectral Einstein functionals for 4D spin manifolds with boundary.
method Generalizes Dabrowski's results to 4D spin manifolds with boundary using noncommutative residue.
result Generalized spectral Einstein functionals computation for 4D spin manifolds with boundary.

Residual Continual Learning prevents forgetting in sequential tasks.

problem Preventing catastrophic forgetting in sequential learning of multiple tasks.
method ResCL reparameterizes network parameters by combining original and fine-tuned networks, keeping network size constant.
result ResCL achieves state-of-the-art performance in various continual learning scenarios.

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 ↗

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 ↗

The study proves residual finiteness for certain lattice extensions and negatively curved projective varieties.

problem Residual finiteness of central extensions of arithmetic lattices in PU(n,1).
method General theorem on residual finiteness of extensions with characteristic class in span of Poincaré duals to totally geodesic divisors.
result Residual finiteness of central extensions for congruence lattices in PU(n,1) for n ≥ 4.

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 ↗

Paper improves bike-sharing demand prediction by adapting to changing patterns.

problem Improving bike-sharing demand prediction under temporal domain shifts.
method Gen-ROTDA, a robust optimal transport-guided residual domain adaptation framework.
result Gen-ROTDA achieves the lowest MAE and is the best OT-family method on average.

Causality-aware methods outperform linear residualization in confounding adjustment for anticausal prediction.

problem Adjusting for confounding in anticausal prediction tasks.
method Causality-aware counterfactual confounding adjustment.
result Causality-aware methods asymptotically outperform linear residualization in predictive performance.