Szabó recently introduced a combinatorially-defined spectral sequence in Khovanov homology. After reviewing its construction and explaining our methodology for computing it, we present results of computations of the spectral sequence. Based on these computations, we make a number of conjectures concerning the structure…
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,742 papers · 148 categories
Trend · papers per month
48 results for “spectral computation”
Paper defines spectral triple and computes functional for nonminimal de Rham-Hodge operator.
problem Computing spectral functions for nonminimal de Rham-Hodge operators.
method Definitions and computations of spectral triple and functional.
result Computed spectral Einstein functional for even-dimensional compact manifolds.
Computes spectral Einstein functional for Witten deformation on even-dimensional spin manifolds.
problem Calculating the spectral Einstein functional for a specific deformation.
method Computes the spectral Einstein functional for the Witten deformation on even-dimensional spin manifolds.
result Computed the spectral Einstein functional for the Witten deformation on even-dimensional spin manifolds.
Defines and computes a generalized spectral action for Lorentz warped products.
problem Computing spectral actions for Lorentz warped products.
method Defines and computes the bimetric spectral Einstein-Hilbert action for Lorentz warped products.
result Derives a Kastler-Kalau-Walze type theorem for Lorentz warped products.
New spectral functionals for Dirac operators with inner fluctuations computed.
problem Spectral functionals and Dirac operators with inner fluctuations.
method Extension of spectral functionals for Dirac operators with inner fluctuations.
result Computed spectral Einstein functional for Dirac operator with inner fluctuations on even-dimensional spin manifolds.
Paper introduces a new multilinear functional for spectral triples and computes its properties.
problem Computing properties of spectral triples and their associated Hodge operators.
method Introduces a new multilinear functional for spectral triples and computes its properties using noncommutative residue and perturbed de-Rham Hodge operators.
result Recover two forms, torsion of the linear connection, and four forms by the noncommutative residue and perturbed de-Rham Hodge Dirac triple.
Quantum computers can enhance spectral methods in machine learning.
problem Spectral methods are fundamental but challenging for classical models.
method Utilizing quantum Fourier Transform for spectral manipulations.
result Quantum computing can offer more efficient spectral design.
Extends spectral Einstein functionals computation to 4D spin manifolds with boundary.
problem Computing spectral Einstein functionals for 4D spin manifolds with boundary.
method Generalizes Dabrowski's results to 4D spin manifolds with boundary using noncommutative residue.
result Generalized spectral Einstein functionals computation for 4D spin manifolds with boundary.
Spectral clustering on spherical coordinates under the degree-corrected stochastic blockmodelstat.ML
New spectral clustering method for graphs with uneven node degrees.
problem Challenges in community detection for graphs with heterogeneous degree distributions.
method Spectral clustering on spherical coordinates with degree correction.
result Improved performance in representing computer networks.
Efficiently scales continuous kernels with sparse Fourier domain learning.
problem High computational and memory demands, spectral bias in continuous kernels.
method Sparse learning in the Fourier domain.
result Efficient scaling of continuous kernels, reduced computational and memory requirements, mitigated spectral bias.
Accelerates optimal transport computation by 10x with spectral insights.
problem Exponential slow-down of convergence in Entropic Optimal Transport as regularization weakens.
method Spectral insights and spectral warm-start strategy to mitigate convergence issues.
result Faster convergence compared to the reference method Sinkhorn algorithm.
New spectral torsion defined for rescaled Dirac operators.
problem Defining spectral torsion for rescaled Dirac operators.
method Using three vector fields and noncommutative residue.
result Computed spectral torsion for one form rescaled Dirac operators.
This paper improves spectral clustering for large datasets using the Nystrom method.
problem Spectral clustering's scalability issues with large datasets.
method A principled spectral clustering algorithm exploiting Nystrom approximation's spectral properties.
result Improved spectral clustering efficiency and accuracy compared to existing methods.
Previous research has shown that computation of convolution in the frequency domain provides a significant speedup versus traditional convolution network implementations. However, this performance increase comes at the expense of repeatedly computing the transform and its inverse in order to apply other network operati…
A large class of machine learning techniques requires the solution of optimization problems involving spectral functions of parametric matrices, e.g. log-determinant and nuclear norm. Unfortunately, computing the gradient of a spectral function is generally of cubic complexity, as such gradient descent methods are rath…
The cost of computing the spectrum of Laplacian matrices hinders the application of spectral clustering to large data sets. While approximations recover computational tractability, they can potentially affect clustering performance. This paper proposes a practical approach to learn spectral clustering based on adaptive…
Proves a conjecture for a specific group using spectral sequences and homology.
problem Proves the Gromov-Lawson-Rosenberg Conjecture for the group Z/4xZ/4.
method Used the Adams spectral sequence and detection theorems to compute connective real k-homology.
result Determines differentials of the Adams spectral sequence and studies the cap structure of relevant sub-hopf algebras.
New methods avoid spectral pollution in transfer operators for accurate analysis.
problem Spectral pollution in finite-dimensional approximations of transfer operators.
method Algorithms for computing spectral properties of transfer operators without spectral pollution.
result Accurate spectral estimation across various applications, including protein folding models.
Spectral clustering is one of the most effective clustering approaches that capture hidden cluster structures in the data. However, it does not scale well to large-scale problems due to its quadratic complexity in constructing similarity graphs and computing subsequent eigendecomposition. Although a number of methods h…
Spectral clustering is a widely studied problem, yet its complexity is prohibitive for dynamic graphs of even modest size. We claim that it is possible to reuse information of past cluster assignments to expedite computation. Our approach builds on a recent idea of sidestepping the main bottleneck of spectral clusterin…
New bounds improve deep learning performance efficiently.
problem Improving generalization and robustness of deep learning models.
method Deriving four provable upper bounds on spectral norm of convolution layers, differentiable and efficient.
result Minimum of four bounds is a tight, differentiable and efficient upper bound on spectral norm.
The paper calculates a functional for a specific Dirac operator.
problem Computing a spectral Einstein functional for a Dirac operator with torsion.
method Computing the spectral Einstein functional for even-dimensional spin manifolds without boundary.
result The spectral Einstein functional for the Dirac operator with torsion is computed.
Extends Einstein-Hilbert action to higher-order spectral triples.
problem No specific problem stated; focuses on extending action.
method Introduced two second-order spectral triples and computed their Einstein-Hilbert actions.
result Demonstrated applicability of the theoretical framework.
Deep learning speeds spectral density estimation for large 2D/3D grids.
problem Computational challenges in estimating spectral densities for large grids.
method Deep learning neural network for spectral density estimation.
result Deep learning estimator is a universal approximator and faster than existing methods.
Higher spectral flowmath.DG
For a continuous curve of families of Dirac type operators we define a higher spectral flow as a -group element. We show that this higher spectral flow can be computed analytically by $\heta$-forms, and is related to the family index in the same way as the spectral flow is related to the index. We introduce a notion…
Given a link in the three-sphere, Ozsváth and Szabó showed that there is a spectral sequence starting at the Khovanov homology of the link and converging to the Heegaard Floer homology of its branched double cover. The aim of this paper is to explicitly calculate this spectral sequence in terms of bordered Floer homolo…
In most convolution neural networks (CNNs), downsampling hidden layers is adopted for increasing computation efficiency and the receptive field size. Such operation is commonly so-called pooling. Maximation and averaging over sliding windows (max/average pooling), and plain downsampling in the form of strided convoluti…
We introduce a new parameterization method for deep learning layers using spectral tensor train decomposition.
problem Efficiency and stability in deep learning models with weight matrix compression.
method Spectral Tensor Train Parameterization (STTP) of weight matrices.
result Improved compression and training stability in neural networks.
This paper describes a topological method to compute the spectral flow of a family of twisted Dirac operators, it includes two detailed examples. Briefly, a formula of Atiyah, Patodi and Singer expresses the spectral flow in terms of Chern-Simons invariants and rho invariants. The first step is to construct a flat cobo…
Improved singular value approximation for convolutional layers.
problem Improving accuracy of singular value approximation for linear convolutional layers.
method Developed a new spectral density matrix method for singular value approximation with improved accuracy and reduced computational complexity.
result Obtained moderate improvement in singular value distribution compared to circular approximation.
The paper explores the Rumin complex and spectral sequence on Carnot groups.
problem Understanding the relationship between Rumin complex and spectral sequence on Carnot groups.
method Investigates the Rumin complex and spectral sequence on Carnot groups, focusing on the filtration by homogeneous weights.
result Provides a detailed insight into the relationship between the Rumin complex and the spectral sequence on Carnot groups.
To each non-isotropic almost-complex immersion of a 2-torus into we associate an algebraic curve, called the spectral curve, and a linear flow in the intersection of two Prym varieties on this spectral curve. We show that generically the spectral curve is smooth and compute the dimension of the moduli space o…
Spectral methods predict long-term signals from linear and nonlinear systems.
problem Forecasting temporal signals from linear and nonlinear systems with arbitrary sampling.
method Introduces a spectral algorithm for linear signals and extends it to nonlinear systems using Koopman theory.
result The spectral methods achieve high accuracy in forecasting and uncertainty quantification.
Spectral clustering approaches have led to well-accepted algorithms for finding accurate clusters in a given dataset. However, their application to large-scale datasets has been hindered by computational complexity of eigenvalue decompositions. Several algorithms have been proposed in the recent past to accelerate spec…
Authors compute stable homology of torus knots using a new deformation technique.
problem Computing stable homology of torus knots.
method Link-splitting deformation (y-ification) of link homology.
result Explicit computation of -ified stable Khovanov--Rozansky homology of torus knots.
The C-spectral sequence was introduced by Vinogradov in the late Seventies as a fundamental tool for the study of algebro-geometric properties of jet spaces and differential equations. A spectral sequence arise from the contact filtration of the modules of forms on jet spaces of a fibring (or on a differential equation…
Study spectral gaps in hyperbolic rational homology spheres.
problem Finding spectral gaps in hyperbolic rational homology spheres.
method Construction of families of hyperbolic rational homology spheres with coexact 1-form spectral gaps.
result Provided intervals containing limit points of spectral gaps, with the rightmost interval being [0.8196, 0.8277].
New spectral functionals related to noncommutative residue and torsion Dirac operators.
problem Spectral functionals and Dirac operators with torsion.
method Noncommutative residue and Dirac operators with torsion.
result Extension of spectral functionals to noncommutative realm with torsion.
SpecNet2 improves spectral embedding without orthogonalization, achieving better performance and efficiency.
problem Improving spectral embedding methods for better performance and efficiency.
method Optimizes an equivalent objective of the eigen-problem without orthogonalization, allowing separate row and column sampling.
result Local and global convergence of the new objective using batch-based gradient descent is proven, and improved performance and efficiency are demonstrated on simulated and image datasets.
The spectral -support norm enjoys good estimation properties in low rank matrix learning problems, empirically outperforming the trace norm. Its unit ball is the convex hull of rank matrices with unit Frobenius norm. In this paper we generalize the norm to the spectral -support norm, whose additional para…
The paper computes metrics and Einstein tensors on even-dimensional manifolds.
problem Computing metrics and Einstein tensors on even-dimensional Riemannian manifolds.
method Development of spectral Einstein functionals and equivariant Bismut Laplacian.
result Explicit computation of the equivariant noncommutative residue density.
We present Spectral Inference Networks, a framework for learning eigenfunctions of linear operators by stochastic optimization. Spectral Inference Networks generalize Slow Feature Analysis to generic symmetric operators, and are closely related to Variational Monte Carlo methods from computational physics. As such, the…
We prove a local index formula in conformal geometry by computing the Connes-Chern character for the conformal Dirac (twisted) spectral triple recently constructed by Connes-Moscovici. Following an observation of Moscovici, the computation reduces to the computation of the CM cocycle of an equivariant Dirac (ordinary) …
Nystrom approximation speeds up kernel model training.
problem Slow convergence in kernel models due to poor conditioning.
method Spectral preconditioning with Nystrom approximation for scalability.
result Nystrom approximation accelerates gradient descent nearly as well as exact preconditioner.
Researchers calculate spectral invariants from Dirichlet-to-Neumann map for Witten-Laplacian with potential.
problem Calculating spectral invariants from Dirichlet-to-Neumann map for Witten-Laplacian with potential.
method Established an effective procedure to calculate all coefficients of the spectral asymptotic formula of the Dirichlet-to-Neumann map.
result Explicitly provided the first four coefficients of the spectral asymptotic formula.
The paper calculates spectral torsion for rescaled Dirac operators on manifolds.
problem Computing spectral torsion for rescaled Dirac operators.
method Using trilinear Clifford multiplication and functional of differential one-forms.
result Computed spectral torsion for four types of rescaled Dirac operators.
A method of computation of its terms is presented together with some stabilization results. As an application a characterization of symplectic harmonic manifolds is given and a relationship with the C-spectral sequence is indicated.
Researchers study spectral asymmetry using pseudodifferential projections on the massless Dirac operator.
problem Understanding spectral asymmetry for the massless Dirac operator.
method Constructing a negative order pseudodifferential asymmetry operator from spectral projections.
result Computed the principal symbol of the asymmetry operator, accounting for gauge invariance.