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

3774110147 · Jun 202019922001200920172026
48 results for Fiedler vector

We argue that the standard graph Laplacian is preferable for spectral partitioning of signed graphs compared to the signed Laplacian. Simple examples demonstrate that partitioning based on signs of components of the leading eigenvectors of the signed Laplacian may be meaningless, in contrast to partitioning based on th…

2017-01-05abs ↗pdf ↗

Fiedler regularization uses spectral graph theory to improve neural network performance.

problem Improving neural network performance by penalizing weights based on connectivity.
method Uses the Fiedler value of the neural network's graph as a regularization tool, providing theoretical and computational methods.
result Demonstrates Fiedler regularization's effectiveness in improving neural network performance.

Fiedler regularization uses graph sparsity to improve neural network training.

problem Improving neural network training by respecting graph structure.
method Using the Fiedler value of the neural network's graph as a regularization tool.
result Fiedler regularization outperforms traditional methods like dropout and weight decay.

In order to obtain a Markov theorem without stabilization, Birman and Menasco introduced the notion of exchange related braids. In this paper I study the way the Fiedler polynomial distinguishes conjugacy classes of some particular braided knots. I introduce the Kauffman bracket in the solid torus. Its Taylor expansion…

2007-09-27abs ↗pdf ↗

The paper examines topological features of ReLU networks and their relation to decision boundaries and training loss.

problem Understanding the topological structure of ReLU neural network activation patterns.
method Polytope decomposition of feature space, Fiedler partition of dual graph, homology computation of cellular decomposition.
result The Fiedler partition of the dual graph correlates with decision boundaries in binary classification tasks, and similar patterns in training loss and polyhedral cell-count emerge in regression tasks.

New insights into spectral clustering reveal strong connections within eigenvectors.

problem Clustering on graphs when there are two underlying clusters.
method Analyzes the eigenvector corresponding to the second largest eigenvalue of the adjacency matrix.
result Vertices with extreme values in the eigenvector are more reliably classified.

This text is intended to become in the long run Chapter 3 of our long saga dedicated to Riemann, Ahlfors and Rohlin. Yet, as its contents evolved as mostly independent (due to our inaptitude to interconnect both trends as strongly as we wished), it seemed preferable to publish it separately. More factually, our account…

2013-10-07abs ↗pdf ↗

We consider diagrams of links in S2S^2 obtained by projection from S3S^3 with the Hopf map and the minimal crossing number for such diagrams. Knots admitting diagrams with at most one crossing are classified. Some properties of these knots are exhibited. In particular, we establish which of these knots are algebraic an…

2019-07-26abs ↗pdf ↗

Study proves consistency of spectral clustering on hierarchical networks.

problem Consistency of spectral clustering on hierarchical stochastic block models.
method Recursive bi-partitioning algorithm based on Fiedler vector of graph Laplacian.
result Strong consistency of the method under various model parameters.

GNNRank uses neural networks to learn global rankings from competition match data.

problem Learning global rankings from pairwise comparisons in directed graphs.
method Proposes GNNRank, a trainable GNN-based framework with digraph embedding and new objectives.
result GNNRank achieves competitive and superior performance compared to baselines.

Spectral dimensionality reduction methods enable linear separations of complex data with high-dimensional features in a reduced space. However, these methods do not always give the desired results due to irregularities or uncertainties of the data. Thus, we consider aggressively modifying the scales of the features to …

2018-05-18abs ↗pdf ↗

Using the Fiedler-Polyak-Viro Gauss diagram formulas we study the Vassiliev invariants of degree 2 and 3 on almost positive knots. As a consequence we show that the number of almost positive knots of given genus or unknotting number grows polynomially in the crossing number, and also recover and extend, inter alia to t…

1998-03-17abs ↗pdf ↗

Using the recent Gauss diagram formulas for Vassiliev invariants of Polyak-Viro-Fiedler and combining these formulas with the Bennequin inequality, we prove several inequalities for positive knots relating their Vassiliev invariants, genus and degrees of the Jones polynomial. As a consequence, we prove that for any of …

1998-05-18abs ↗pdf ↗

Rigidity is the property of a structure that does not flex. It is well studied in discrete geometry and mechanics, and has applications in material science, engineering and biological sciences. A bar-and-joint framework is a pair (G,p)(G,p) of graph GG together with a map pp of the vertices of GG into the Euclidean pla…

2020-01-20abs ↗pdf ↗

The zero locus of a function f on a graph G is defined as the graph with vertex set consisting of all complete subgraphs of G, on which f changes sign and where x,y are connected if one is contained in the other. For d-graphs, finite simple graphs for which every unit sphere is a d-sphere, the zero locus of (f-c) is a …

2015-08-23abs ↗pdf ↗

Speaker verification (SV) systems using deep neural network embeddings, so-called the x-vector systems, are becoming popular due to its good performance superior to the i-vector systems. The fusion of these systems provides improved performance benefiting both from the discriminatively trained x-vectors and generative …

2018-09-17abs ↗pdf ↗

The paper proves that certain modified conformal vector fields are trivial on compact and non-compact manifolds.

problem Proving triviality of modified conformal vector fields on Riemannian manifolds.
method Analyzing properties of homothetic, conformal, and gradient vector fields on compact and non-compact manifolds.
result Established conditions under which mm-modified conformal vector fields are trivial.

The position vector field x is the most elementary and natural geometric object on a Euclidean submanifold MM. The position vector field plays very important roles in mathematics as well as in physics. Similarly, the tangential component x^T of the position vector field is the most natural vector field tangent to the …

2017-12-24abs ↗pdf ↗

For a submanifold M in a Euclidean space, the tangential component x^T of the position vector field x of M is the most natural vector field tangent to the Euclidean submanifold, called the canonical vector field of M. In this article, first we prove that the canonical vector field of every Euclidean submanifold is alwa…

2018-01-22abs ↗pdf ↗

Study biharmonic vector fields and unit vector fields on Riemannian manifolds.

problem Determine the equivalence of biharmonicity and harmonicity for vector fields and unit vector fields on Riemannian manifolds.
method Analyze biharmonic vector fields and unit vector fields on (M,g)(M,g) with pseudo-Riemannian gg-natural metrics on TMTM and T1MT_1M.
result Contrary to Sasaki metric, biharmonicity and harmonicity are not equivalent for large classes of gg-natural metrics on TMTM.

The paper bounds the mean absolute error in DNN vector-to-vector regression.

problem Bounding the mean absolute error in deep neural network based vector-to-vector regression.
method Error decomposition techniques in statistical learning theory and non-convex optimization theory were used to derive upper bounds for approximation, estimation, and optimization errors.
result Theoretical upper bounds for mean absolute error in DNN vector-to-vector regression were derived and validated experimentally.

This short report establishes some basic properties of smooth vector fields on product manifolds. The main results are: (i) On a product manifold there always exists a direct sum decomposition into horizontal and vertical vector fields. (ii) Horizontal and vertical vector fields are naturally isomorphic to smooth famil…

2011-06-05abs ↗pdf ↗

Defines quaternionic k-vector fields on quaternionic Kähler manifolds.

problem No specific problem stated; focuses on definition and properties.
method Introduced a modified Dirac operator to define quaternionic k-vector fields.
result Calculated the dimension of quaternionic k-vector fields on HPn\mathbb{H}P^n.

SVM generalizes well even with many support vectors in high dimensions.

problem Generalization of SVM in high-dimensional spaces with many support vectors.
method Identified new deterministic equivalences and proved conditions for support vector proliferation.
result Broadened conditions for SVM generalization in high-dimensional settings and proved converse result.

Optimal transport for vector Gaussian mixtures improves efficiency and structure preservation.

problem Optimal mass transport for vector-valued Gaussian mixtures.
method Vectorizing Gaussian mixture models and studying optimal mass transport problems.
result Computational efficiency and structure preservation in optimal mass transport.

Study on vector fields on Lie groups reveals surprising algebraic coincidences.

problem Characterizing vector fields on Lie groups with Riemannian metrics.
method Algebraic and geometric analysis of left-invariant vector fields on nilpotent Lie groups.
result Spaces of Killing, one-harmonic, and conformal vector fields coincide with the center of the Lie algebra on nilpotent Lie groups.

This paper introduces \infty- and nn-fold vector bundles as special functors from the \infty- and nn-cube categories to the category of smooth manifolds. We study the cores and "n-pullbacks" of nn-fold vector bundles and we prove that any nn-fold vector bundle admits a non-canonical isomorphism to a decomposed …

2018-09-05abs ↗pdf ↗

Study on generalized derivations in polynomial vector fields Lie algebras.

problem Understanding generalized derivations in specific Lie sub-algebras of polynomial vector fields.
method Analysis of Lie sub-algebras containing constant and Euler vector fields, under specified conditions.
result Characterization of generalized derivations in the studied Lie sub-algebras.