Every non-trivial knot group is fully residually perfect.
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.
Trend · papers per month
In every conformal class of Finsler (or Riemannian) metrics on a closed manifold there exists a residual subset of Finsler metrics, such that, with respect to the residual Finsler metrics, in any non-trivial homotopy class of free loops there is precisely one shortest geodesic loop.
Researchers expand on best subset selection theory, identifying key complexities.
The skip-connections used in residual networks have become a standard architecture choice in deep learning due to the increased training stability and generalization performance with this architecture, although there has been limited theoretical understanding for this improvement. In this work, we analyze overparameter…
A method for finding most influential sets reduces a complex problem to a sequence of simpler top- problems.
We show that for a 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.
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…
New method for evaluating and learning in complex decision-making scenarios.
Paper improves bike-sharing demand prediction by adapting to changing patterns.
Study the intersection of positive closed currents using tangent currents and King's residue formula.
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…
The paper extends structures to generic closed two-forms on manifolds.
The paper explores how agents can generalize to new environments with unseen variables.
AANets balance stability and plasticity in CIL.
We study a seemingly unexpected and relatively less understood overfitting aspect of a fundamental tool in sparse linear modeling - best subset selection, which minimizes the residual sum of squares subject to a constraint on the number of nonzero coefficients. While the best subset selection procedure is often perceiv…
In real-world machine learning applications, data subsets correspond to especially critical outcomes: vulnerable cyclist detections are safety-critical in an autonomous driving task, and "question" sentences might be important to a dialogue agent's language understanding for product purposes. While machine learning mod…
New method solves sparse approximation problem using trimmed lasso and generalized soft-min penalties.
Many features of dimensional reduction schemes are determined by the breaking of higher dimensional general covariance associated with the selection of a particular subset of coordinates. By investigating residual covariance we introduce lower dimensional tensors --generalizing to one side Kaluza-Klein gauge fields and…
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…
Study geodesics on flat tori, focusing on convex bodies.
Given (M, g0) we consider the problem -ε^2Delta_{g0+h}u + u = (u+)^{p-1} with (ε, h) \in (0, ε0) \times Bρ. Here Bρ is a ball centered at 0 with radius ρ in the Banach space of all Ck symmetric covariant 2-tensors on M. Using the Poincaré polynomial of M, we give an estimate on the number of nonconstant solutions with …
We consider an analytic family of Riemannian metrics on a compact smooth manifold . We assume the Dirichlet boundary condition for the -Laplacian and obtain Hadamard type variation formulas for analytic curves of eigenfunctions and eigenvalues. As an application, we show that for a subset of all Riemannian …
Experience reuse is key to sample-efficient reinforcement learning. One of the critical issues is how the experience is represented and stored. Previously, the experience can be stored in the forms of features, individual models, and the average model, each lying at a different granularity. However, new tasks may requi…
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…
Abstract: Non-residually finite hyperbolic groups imply non-residually finite rigid hyperbolic groups.
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…
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…
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…
Sparse subspace clustering (SSC) using greedy-based neighbor selection, such as matching pursuit (MP) and orthogonal matching pursuit (OMP), has been known as a popular computationally-efficient alternative to the conventional L1-minimization based methods. Under deterministic bounded noise corruption, in this paper we…
Residual flows are shown to approximate MMD well.
Let be a prime. In this paper, we classify the geometric 3-manifolds whose fundamental groups are virtually residually . Let be a virtually fibered 3-manifold. It is well-known that is residually solvable and even residually finite solvable. We prove that is always virtually residually …
Researchers identify critical protein residues using advanced graph theory.
In this paper, we study Lipschitz-Fredholm vector fields on Bounded-Fréchet-Finsler manifolds. In this context we generalize the Morse-Sard-Brown theorem, asserting that if is a connected smooth bounded-Fréchet-Finsler manifold endowed with a strengthened connection and if is a smooth Lipschitz-Fr…
Defines Wodzicki residue using groupoids and fibered distributions.
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 …
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…
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…
Wide residual networks generalize well with uniform convergence to RNTK as width increases.
PSiLON Net uses weight normalization and 1-path-norm regularization for efficient learning and sparsity.
Given a prime , a group is called residually if the intersection of its -power index normal subgroups is trivial. A group is called virtually residually if it has a finite index subgroup which is residually . It is well-known that finitely generated linear groups over fields of characteristic zero are …
The paper studies residues of manifolds and their applications in geometry.
We show that Out(G) is residually finite if G is a one-ended group that is hyperbolic relative to virtually polycyclic subgroups. More generally, if G is one-ended and hyperbolic relative to proper residually finite subgroups, the group of outer automorphisms preserving the peripheral structure is residually finite. We…
Simplifies residual flows to make flow-based modeling more practical.
Study on endomorphism and automorphism groups of specific quandles.
Unified ODE model explains residual and non-residual networks.
Defines and proves generalized noncommutative residue theorems for specific dimensions.
Proves Singer conjecture for graph manifolds with residually finite groups.
Study excess logarithmic residues for foliations to bound invariant hypersurfaces and test log canonicity.