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

Trend · papers per month

25.0%50.0%75.0%100.0% · Sep 199219922001200920172026
48 results for linearly connected

Study how neural networks optimize to stable linearly connected regions.

problem Understanding how neural networks converge to stable solutions under different training conditions.
method Investigate the stability of neural networks to SGD noise and apply it to iterative magnitude pruning.
result Subnetworks that reach full accuracy must be stable to SGD noise, either at initialization or early in training.

The paper explores linearly free graphs and their embeddings into 3D space.

problem Understanding the conditions under which a graph's embedding into 3D space is free.
method Developed a sufficient condition for a linear embedding to be free and applied it to specific graph cases.
result Established sufficient conditions for a graph to be linearly free and provided examples and counterexamples.

In previous work, the authors studied the linear stability of algebraic Ricci solitons on simply connected solvable Lie groups (solvsolitons), which are stationary solutions of a certain normalization of Ricci flow. Many examples were shown to be linearly stable, leading to the conjecture that all solvsolitons are line…

2014-09-10abs ↗pdf ↗

We show how a polar representation of a compact connected Lie group can be linearly determined from its dimension and isotropy subgroup data in the general reducible case.

2017-04-11abs ↗pdf ↗

Study left invariant spray geometry on Lie groups using parallel translations.

problem Understanding parallel translations in left invariant spray geometry.
method Using invariant frames and differential equations on Lie algebra, study parallel translations and curvature.
result Alternative interpretations and proofs of homogeneous curvature formulae.

If M=(M,)\mathcal{M}=(M,\nabla) is an affine surface, let Q(M):=ker(H+1m1ρs)\mathcal{Q}(\mathcal{M}):=\ker(\mathcal{H}+\frac1{m-1}ρ_s) be the space of solutions to the quasi-Einstein equation for the crucial eigenvalue. Let M~=(M,~)\tilde{\mathcal{M}}=(M,\tilde\nabla) be another affine structure on MM which is strongly projectively flat. We sh…

2018-06-18abs ↗pdf ↗

Spheres in curve graphs are connected, proving Gromov boundary linearity.

problem Understanding connectivity in curve graphs and their boundaries.
method Defining spheres and analyzing their connectivity for different complexities.
result Spheres in high complexity curve graphs are always connected, with weaker results for low complexity.

It is proved that an arbitrary finite group acting locally linearly, homologically trivially, and pseudofreely on a closed, simply connected 4-manifold must in fact be cyclic and act semifreely, provided the second betti number of the manifold is at least three.

1998-09-10abs ↗pdf ↗

In this paper we prove that the Casson-Gordon invariants of the connected sum of two knots split when the Alexander polynomials of the knots are coprime. As one application, for any knot K, all but finitely many algebraically slice twisted doubles of K are linearly independent in the knot concordance group.

2001-02-15abs ↗pdf ↗

We show that if the connected sum of two knots with coprime Alexander polynomials has vanishing von Neumann rho-invariants associated with certain metabelian representations then so do both knots. As an application, we give a new example of an infinite family of knots which are linearly independent in the knot concorda…

2007-10-10abs ↗pdf ↗

This work refines claims about neural network connectivity, showing that simultaneous linear connectivity is possible under certain conditions.

problem Neural networks' loss landscapes are non-convex due to permutation symmetries, leading to high loss barriers between permuted networks.
method The authors introduce and analyze three claims of increasing strength regarding the connectivity of neural networks, focusing on permutations that align networks.
result The authors provide evidence that strong linear connectivity may be possible under certain conditions, specifically when interpolating among three networks of increasing width.

We show that gradient descent on full-width linear convolutional networks of depth LL converges to a linear predictor related to the 2/L\ell_{2/L} bridge penalty in the frequency domain. This is in contrast to linearly fully connected networks, where gradient descent converges to the hard margin linear support vector m…

2018-06-01abs ↗pdf ↗

The paper studies a new connection on Riemannian manifolds and finds conditions for symplectic manifolds.

problem Exploring a new quarter-symmetric non-metric connection on Riemannian manifolds.
method Analyzes the properties and relations of the torsion tensor and curvature tensors of the new connection.
result Conditions for a manifold to be symplectic when endowed with the new connection.

Study on singular points of translation surfaces under linearly dependent conditions.

problem Investigate singular points of translation surfaces under linearly dependent conditions.
method Use theories of generalised framed surfaces and framed surfaces.
result Introduce translation generalised framed surfaces and investigate their singular points.

Study reveals how Fisher information changes with network depth, finding it grows linearly.

problem Understanding the trainability of deep neural networks (DNNs).
method Investigates the spectral distribution of the conditional Fisher information matrix (FIM) for fully-connected networks achieving dynamical isometry.
result The conditional FIM's spectrum concentrates around the maximum and grows linearly with depth.

The paper studies quarter-symmetric connections on Hermitian and Kähler manifolds.

problem Examining quarter-symmetric connections on almost Hermitian and Kähler manifolds.
method Analyzing the curvature tensors and their properties with respect to quarter-symmetric connections.
result Constructed tensors that do not depend on the quarter-symmetric connection generator, including the Weyl projective curvature tensor.

This work tackles Bayesian neural networks by addressing loss landscape symmetries.

problem Understanding and optimizing the loss landscape of Bayesian neural networks.
method The approach involves extending marginalized loss barrier formalism to BNNs, proposing a matching algorithm to search for linearly connected solutions using permutation matrices and combinatorial optimization.
result Nearly zero marginalized loss barriers for linearly connected solutions were found.

Examines the linear independence of curvature tensors and pseudotensors in non-symmetric affine connection spaces.

problem Determining the linear independence of curvature tensors and pseudotensors in non-symmetric affine connection spaces.
method Analyzes the number of covariant derivatives and curvature tensors/pseudotensors required for a complete study, and examines their linear independence.
result Identifies the number of curvature tensors and pseudotensors that are linearly independent in non-symmetric affine connection spaces.

The paper studies the connectedness of a graph's boundary for surfaces.

problem Understanding the topology of the Gromov boundary of fine curve graphs for surfaces.
method Proved a bounded geodesic image theorem, used to show linear connectivity of the Gromov boundary.
result The Gromov boundary of fine curve graphs for surfaces is linearly connected.

Proposes a framework for learning constrained motor skills.

problem Learning constrained motor skills in robotic systems.
method Exploits probabilistic properties of multiple demonstrations in a linearly constrained optimization problem.
result Proposes a non-parametric solution for constrained motor skills.

If a (possibly finite) compact Lie group acts effectively, locally linearly, and homologically trivially on a closed, simply-connected four-manifold with second Betti number at least three, then it must be isomorphic to a subgroup of S^1 x S^1, and the action must have nonempty fixed-point set. Our results strengthen a…

1999-07-27abs ↗pdf ↗

Quasispheres can be approximated by smooth spheres.

problem Characterizing quasispheres using geometric conditions.
method Proving every quasisphere is a limit of smooth spheres and providing necessary and sufficient conditions for uniform quasispheres.
result Every quasisphere can be approximated by uniform quasispheres that satisfy specific geometric conditions.

Contextual multi-armed bandit problems arise frequently in important industrial applications. Existing solutions model the context either linearly, which enables uncertainty driven (principled) exploration, or non-linearly, by using epsilon-greedy exploration policies. Here we present a deep learning framework for cont…

2018-07-25abs ↗pdf ↗

Push-SAGA is a decentralized algorithm for directed graphs that converges linearly.

problem Finite-sum minimization over directed graphs with stochastic gradients.
method Combines variance reduction, gradient tracking, and consensus algorithms.
result Achieves linear convergence for smooth and strongly convex problems.

We give simple homological conditions for a rational homology 3-sphere Y to have infinite order in the rational homology cobordism group, and for a collection of rational homology spheres to be linearly independent. These translate immediately to statements about knot concordance when Y is the branched double cover of …

2018-03-21abs ↗pdf ↗

If a closed 3-manifold M supports a closed, nonsingular, irrational 1-form which linearly deforms into contact forms, then M supports a K-contact form. On the 3-torus, a closed nonsingular 1-form deforms linearly into contact forms if and only if it is a fibration 1-form. on any other 2-torus bundle over the circle, ev…

2008-12-17abs ↗pdf ↗

A new algorithm solves bilevel optimization with linear constraints.

problem Solving bilevel optimization problems with coupled linear constraints.
method Penalty and augmented Lagrangian methods reformulate the problem; a single-loop, first-order algorithm proposed.
result Improved convergence rates compared to prior methods.

LCW reduces activation shift in neural networks, improving training efficiency and generalization.

problem Activation shift in neural networks leading to non-zero mean preactivation values.
method Linearly constrained weights (LCW) to reduce activation shift in fully connected and convolutional layers.
result LCW resolves the vanishing gradient problem and improves generalization of neural networks.

The paper connects decision tree interpretability and robustness through separation.

problem Empirical observation of a connection between robustness and interpretability in decision trees.
method Investigation of the connection through decision trees and ll_{\infty}-perturbation robustness, proving bounds on tree size.
result First algorithm with guarantees on robustness, interpretability, and accuracy for decision trees.

We analyze the size of the dictionary constructed from online kernel sparsification, using a novel formula that expresses the expected determinant of the kernel Gram matrix in terms of the eigenvalues of the covariance operator. Using this formula, we are able to connect the cardinality of the dictionary with the eigen…

2012-06-18abs ↗pdf ↗

A quadratic line complex is a three-parameter family of lines in projective space P^3 specified by a single quadratic relation in the Plucker coordinates. Fixing a point p in P^3 and taking all lines of the complex passing through p we obtain a quadratic cone with vertex at p. This family of cones supplies P^3 with a c…

2012-04-12abs ↗pdf ↗

Paper explores how unsupervised learning can be understood through linear algebra concepts.

problem Understanding unsupervised learning through linear algebra concepts.
method Introducing the concept of linearly independent populations and using them to solve for prevalence values.
result Unsupervised learning can be realized as a generalization of supervised learning.

An embedding of a graph into R3\mathbb{R}^3 is said to be linear, if any edge of the graph is sent to be a line segment. And we say that an embedding ff of a graph GG into R3\mathbb{R}^3 is free, if π1(R3f(G))π_1(\mathbb{R}^3-f(G)) is a free group. It was known that for any complete graph its linear embedding is always free.…

2014-09-24abs ↗pdf ↗

In his celebrated paper "Generic projections", John Mather has given a striking transversality theorem and its applications on generic projections. On the other hand, in this paper, two transversality theorems on generic linearly perturbed CrC^r mappings are shown (r1)(r\geq 1). Moreover, some applications of the two the…

2018-06-13abs ↗pdf ↗