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.

169,051 papers · 148 categories

Trend · papers per month

5241,0481,5712,095 · Jun 202019922001200920182026
48 results for Connections with parameters

Differential Galois theory connects connections with parameters to isomonodromic deformations.

problem Understanding the Galois group of connections with parameters.
method Geometric setting and classical results on differential algebraic groups and Lie algebra bundles.
result Galois groups of connections with parameters are determined by isomonodromic deformations.

We assume a vector bundle p:EMp: E\to M with a general linear connection KK and a classical linear connection $\Lam$ on MM. We prove that all classical linear connections on the total space EE naturally given by $(\Lam, K)$ form a 15-parameter family. Further we prove that all connections on J1EJ^1 E naturally given by…

2004-10-21abs ↗pdf ↗

Study improves queue length estimation from connected vehicles by filtering parameters.

problem Large errors in estimated queue lengths at low market penetration rates.
method Used Kalman and Particle filters as multilevel real-time estimators.
result Filters reduce estimation errors and improve accuracy within 15 minutes.

Stanza separates convolutional and fully connected layers for faster deep learning training.

problem Heavy data transfer between workers and servers in distributed deep learning.
method Layer separation: most nodes train convolutional layers, others train fully connected layers only.
result Significant acceleration of training time (1.34x--13.9x) over current systems.

The study shows removing fully connected output layers improves efficiency without sacrificing performance.

problem Large number of parameters in fully connected layers for high-category datasets.
method Examined architectures replacing fully connected output layers with fixed layers and compared performance.
result Fixed classifiers offer no additional benefit over removing the output layer and its parameters.

DenseNets improve accuracy and efficiency in convolutional networks.

problem Improving accuracy and efficiency in deep convolutional networks.
method Introducing Dense Convolutional Networks (DenseNet) with direct connections between all layers.
result DenseNets achieve significant improvements over state-of-the-art networks on object recognition benchmarks.

In this paper we prove the infinitesimal uniqueness theorem for the Newton potential of non simply connected bodies using the singularity theory approach. We consider the Newtonian potentials of the domains in Rn{\bf R}^n boundaries of which are the vanishing cycles on the level hypersurface of a holomorphic function w…

2001-11-11abs ↗pdf ↗

Study explores warped geometries of tensor manifolds, finding non-geodesic connections for some parameters.

problem Investigate non-geodesic connections in warped Segre-Veronese manifolds.
method Investigate a one-parameter family of warped geometries, presenting closed expressions for maps and distance.
result Segre-Veronese manifolds are not geodesically connected in Euclidean geometry but can be for some warping parameters.

We analyze a Lagrangian for spacetime connections in Loop Quantum Gravity.

problem Classical field theory in Loop Quantum Gravity with spacetime connections.
method Complete variational analysis using vector-valued differential forms.
result Equations for θθ are equivalent to vacuum Einstein Field Equations; equations for AA and κκ give the same constraint.

We introduce the equation of n-dimensional totally geodesic submanifolds of a manifold E as a submanifold of the second order jet space of n-dimensional submanifolds of E. Next we study the geometry of n-Grassmannian equivalent connections, that is linear connections without torsion admitting the same equation of n-dim…

2006-04-18abs ↗pdf ↗

Our work connects parameter magnitudes and Hessian eigenspaces in deep neural nets.

problem Understanding the relationship between parameter magnitudes and Hessian curvature in deep learning models.
method Developed a matrix-free algorithm based on sketched SVDs to measure similarity between parameter masks and Hessian eigenspaces.
result Top Hessian eigenvectors tend to be concentrated around larger parameters, indicating a connection between parameter magnitudes and loss curvature.

Paper constructs solutions to a system using Aeppli class without auxiliary gauge connection.

problem Constructing solutions to the Hull-Strominger system without auxiliary gauge connection.
method Deforming conformally balanced metric and tuning by Aeppli class to satisfy anomaly cancellation condition.
result Existence of family of solutions obtained via implicit function theorem.

Empirical study shows removing neural parameter symmetries impacts model performance.

problem Understanding the impact of neural parameter symmetries on model performance.
method Developed two methods to reduce parameter space symmetries in neural networks.
result Removing parameter symmetries can lead to faster and more effective Bayesian neural network training.

Functional dimension varies in ReLU networks, with implications for symmetry and connectivity.

problem Understanding the functional dimension of ReLU neural networks.
method Careful definition and analysis of functional dimension, study of quotient space and fibers.
result Functional dimension is inhomogeneous and can be non-constant, with implications for symmetry and connectivity.

In four dimensions one can use the chiral part of the spin connection as the main object that encodes geometry. The metric is then recovered algebraically from the curvature of this connection. We address the question of how isometries can be identified in this "pure connection" formalism. We show that isometries are r…

2020-02-12abs ↗pdf ↗

Constructs Lagrangian correspondences for Higgs bundles and holomorphic connections.

problem Realizing geometric Langlands correspondences for Higgs bundles and connections.
method Using transversal Higgs bundles and holomorphic connections, induced divisors and parameters.
result Evidence suggests generic realization of Dolbeault geometric Langlands correspondence.

Constructs moduli stacks for quiver connections and extends non-Abelian Hodge theory.

problem Extending non-Abelian Hodge theory to moduli stacks of quiver connections.
method Formalizes and constructs moduli stacks of bundles with λ-connections over prestacks.
result Shows moduli stacks are algebraic and locally of finite presentation when base is smooth and projective.

Mesoscopic model infers neural population dynamics from spike trains.

problem Challenges in fitting mechanistic spiking networks to empirical population data.
method Fit mesoscopic model to aggregate population activity, using likelihood of single-neuron and connectivity parameters.
result Extracts posterior correlations between model parameters and defines subsets of parameters able to reproduce data.

This paper explains GCNs using NTKs and improves their performance.

problem GCNs' performance degrades with depth, and skip connections marginally improve it.
method Derive NTKs for GCNs, validate with simulations, propose NTK as a surrogate model.
result Suitable normalisation can prevent drastic performance drop with depth.

Improved traffic flow prediction model using Kalman filter noise reduction.

problem Low accuracy in predicting traffic flow parameters due to limited connected vehicle data.
method Combined LSTM with Kalman filter-based RTS noise reduction.
result Reduced prediction errors by 50-70% for speed and space headway.

We systematically discuss connections on the spinor bundle of Cahen-Wallach symmetric spaces. A large class of these connections is closely connected to a quadratic relation on Clifford algebras. This relation in turn is associated to the symmetric linear map that defines the underlying space. We present various soluti…

2013-08-28abs ↗pdf ↗

New connection found between shape reconstruction methods and persistent homology.

problem Connecting shape reconstruction methods with persistent homology.
method Wrap complexes and lexicographic optimal homologous cycles.
result Lexicographically optimal homologous cycles are supported on Wrap complexes.

AI detects LDDoS attacks by analyzing TCP connection parameters.

problem Detecting low-rate LDDoS attacks that overwhelm server connections.
method AI algorithms trained on simulated and real-world datasets using TCP flow features.
result Decision trees and k-NN achieved high accuracy in classifying attacks, with low false positives and negatives.

Study higher genus polylogarithms under Riemann surface degenerations.

problem Understanding higher genus polylogarithms under degenerations.
method Investigate the Enriquez connection for polylogarithms and show it becomes a known connection for families of Riemann surfaces.
result Higher genus polylogarithms can be described explicitly as power series in deformation parameters and logarithms of families.

Structural RBM reduces parameters for image denoising and classification.

problem High parameter count in RBMs limits their applicability to large datasets.
method Introduces SRBM with constrained connections to reduce parameters.
result SRBM achieves better performance and faster training than vanilla RBM.

Nontrivial connectivity has allowed the training of very deep networks by addressing the problem of vanishing gradients and offering a more efficient method of reusing parameters. In this paper we make a comparison between residual networks, densely-connected networks and highway networks on an image classification tas…

2017-11-28abs ↗pdf ↗

We define the notion of a formal connection for a smooth family of star products with fixed underlying symplectic structure. Such a formal connection allows one to relate star products at different points in the family. This generalizes the formal Hitchin connection introduced by the first author. We establish a necess…

2014-10-07abs ↗pdf ↗

The fully connected layers of a deep convolutional neural network typically contain over 90% of the network parameters, and consume the majority of the memory required to store the network parameters. Reducing the number of parameters while preserving essentially the same predictive performance is critically important …

2014-12-22abs ↗pdf ↗

Skip connections improve biologically-inspired learning rules.

problem Biologically-inspired learning rules often underperform compared to backpropagation.
method Introduced skip connections between intermediate layers in biologically-motivated learning rules.
result Skip connections can match the performance of backpropagation and are robust to hyper-parameters.

The stochastic block model (SBM) is a probabilistic model for community structure in networks. Typically, only the adjacency matrix is used to perform SBM parameter inference. In this paper, we consider circumstances in which nodes have an associated vector of continuous attributes that are also used to learn the node-…

2018-03-07abs ↗pdf ↗

There is a well known one--parameter family of left invariant CR structures on SU(2)S3SU(2)\cong S^3. We show how purely algebraic methods can be used to explicitly compute the canonical Cartan connections associated to these structures and their curvatures. We also obtain explicit descriptions of tractor bundles and tracto…

2006-03-31abs ↗pdf ↗