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,694 papers · 148 categories

Trend · papers per month

3570104139 · May 202619922001200920172026
48 results for residual subsets

Researchers expand on best subset selection theory, identifying key complexities.

problem Understanding model selection performance in high-dimensional sparse linear regression.
method Analyzing residualized signals, orthogonality, and spurious projections to establish margin conditions.
result Established necessary and sufficient margin conditions for BSS model consistency.

A method for finding most influential sets reduces a complex problem to a sequence of simpler top-kk problems.

problem Identifying most influential subsets in complex models.
method Reduces the problem to a sequence of top-kk problems using Dinkelbach's method.
result The method returns a globally optimal set for the univariate ratio objective, including partial linear models.

We show that for a C1C^1 residual subset of diffeomorphisms far away from tangency, every non-trivial chain recurrent class that is accumulated by sources ia a homoclinic class contains periodic points with index 1 and it's the Hausdorff limit of a family of sources.

2007-12-04abs ↗pdf ↗

To find efficient screening methods for high dimensional linear regression models, this paper studies the relationship between model fitting and screening performance. Under a sparsity assumption, we show that a subset that includes the true submodel always yields smaller residual sum of squares (i.e., has better model…

2012-12-04abs ↗pdf ↗

New method for evaluating and learning in complex decision-making scenarios.

problem Evaluating and learning from policies in contextual combinatorial bandits with high bias and variance.
method Factored action space decomposition and importance sampling-based estimator (OPCB).
result OPCB achieves superior performance in OPE and OPL compared to conventional methods.

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.

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.

A compact Polish foliated space is considered. Part of this work studies coarsely quasi-isometric invariants of leaves in some residual saturated subset when the foliated space is transitive. In fact, we also use "equi-" versions of this kind of invariants, which means that the definition is satisfied with the same con…

2014-06-06abs ↗pdf ↗

The paper extends LL_\infty structures to generic closed two-forms on manifolds.

problem Deformation of coisotropic submanifolds in symplectic manifolds.
method Introduces residual subset of closed 2-forms and associates LL_\infty spaces to strata of Whitney stratifications.
result Existence of a residual subset of closed 2-forms admitting Whitney stratifications.

The paper explores how agents can generalize to new environments with unseen variables.

problem Generalizing to new environments with unseen variables.
method Investigates and proposes a method for efficient re-use of past marginal information to achieve out-of-variable generalization.
result The residual distribution after fitting a classifier reveals partial derivatives of the true generating function with respect to unobserved causal parents.

New method solves sparse approximation problem using trimmed lasso and generalized soft-min penalties.

problem Sparse approximation or best subset selection problem.
method Regularized approach with trimmed lasso and generalized soft-min penalties.
result The trimmed lasso provides sparse recovery guarantees and a practical optimization algorithm.

We strengthen Marshall Hall's Theorem to show that free groups are locally extended residually alternating. Let F be any free group of rank at least two, let H be a finitely generated subgroup of infinite index in F and let {g_1,...,g_n} be a finite subset of F-H. Then there is a surjection f from F to a finite alterna…

2010-04-30abs ↗pdf ↗

Dimensionality reduction is a first step of many machine learning pipelines. Two popular approaches are principal component analysis, which projects onto a small number of well chosen but non-interpretable directions, and feature selection, which selects a small number of the original features. Feature selection can be…

2018-12-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 ↗

A wide variety of application domains are concerned with data consisting of entities and their relationships or connections, formally represented as graphs. Within these diverse application areas, a common problem of interest is the detection of a subset of entities whose connectivity is anomalous with respect to the r…

2014-01-29abs ↗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 ↗

For a manifold with nonpositive curvature, the Martin boundary is described by the behavior of normalized Green's functions at infinity. A classical result by Anderson and Schoen states that if the manifold has pinched negative curvature, the geometric boundary is the same as the Martin boundary. In this paper, we stud…

2017-06-14abs ↗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 ↗

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.

PSiLON Net uses L1L_1 weight normalization and 1-path-norm regularization for efficient learning and sparsity.

problem Efficient learning and sparsity in neural networks with limited data.
method PSiLON Net employs L1L_1 weight normalization and 1-path-norm regularization to simplify the 1-path-norm and achieve efficient learning and near-sparse parameters.
result PSiLON Net achieves reliable optimization and strong performance in the small data regime.

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 ↗

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.

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.

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.

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 excess logarithmic residues for foliations to bound invariant hypersurfaces and test log canonicity.

problem Bounding invariant hypersurfaces and testing log canonicity of singularities.
method Introduce excess logarithmic residues, prove residue formula, derive Poincaré-type bound, and use them to recover log discrepancies.
result Componentwise logarithmic residues of a lifted foliation along the exceptional divisor recover log discrepancies of singularities.