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

Trend · papers per month

83166249332 · Jun 202019922001200920172026
48 results for spectral multiplicity

New Khovanov homology for links with multiple punctures.

problem Defining a new Khovanov homology for links with multiple punctures.
method Defined a variant of Khovanov homology for links in thickened disks with multiple punctures, related to previous work by spectral sequences.
result Spectral sequences recover annular Khovanov homology to Khovanov homology.

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.

Proposes RNSE for clustering with adaptive similarity matrix learning.

problem Sub-optimal results due to mismatch between stages in Spectral Clustering.
method End-to-end single-stage learning with adaptive similarity matrix and non-negative constraints.
result Superior clustering performance on synthetic and real-world datasets.

We propose an iterative gradient-based algorithm to efficiently solve the portfolio selection problem with multiple spectral risk constraints. Since the conditional value at risk (CVaR) is a special case of the spectral risk measure, our algorithm solves portfolio selection problems with multiple CVaR constraints. In e…

2014-10-20abs ↗pdf ↗

HSSE framework embeds single-cell RNA-seq data at multiple scales.

problem Capturing heterogeneous local structure in single-cell RNA-seq data.
method Hierarchical sheaf spectral embedding (HSSE) framework.
result HSSE achieves competitive or improved performance in single-cell RNA-seq data representation learning.

New method detects and analyzes correlation in multiple network data.

problem Detecting and analyzing correlation in multiple network data.
method Generalized omnibus embedding methodology.
result Induced correlation can significantly extend the reach of spectral inference procedures.

We construct certain spectral triples in the sense of A. ~Connes and H. Moscovici (``The local index formula in noncommutative geometry'' {\it Geom. Funct. Anal.}, 5(2):174--243, 1995) that is transversally elliptic but not necessarily elliptic. We prove that these spectral triples satisfie the conditions which ensure …

2003-11-05abs ↗pdf ↗

The paper studies obstructions to homotopy invariance of loop coproducts.

problem Characterizing obstructions to homotopy invariance of loop coproducts.
method Using a construction of Geoghegan and Nicas, the paper defines the Reidemeister trace and realizes the Goresky-Hingston coproduct as a map of spectra.
result The failure of a map to entwine spectral coproducts can be characterized by Chas-Sullivan multiplication with the Reidemeister trace.

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…

2018-06-06abs ↗pdf ↗

Proposes CRG_IMSC for better clustering of multi-view data.

problem Lack of effective connectivity in clustering results.
method Directly obtains clustering result with nonnegative constraint; constructs connectivity matrix based on spectral clustering result; uses multiplicative update algorithm.
result Improves clustering performance on benchmark datasets.

We introduce the stochastic multiplicative point process modelling trading activity of financial markets. Such a model system exhibits power-law spectral density S(f) ~ 1/f**beta, scaled as power of frequency for various values of beta between 0.5 and 2. Furthermore, we analyze the relation between the power-law autoco…

2004-12-28abs ↗pdf ↗

A new method detects hidden driving forces in systems with multiple observables.

problem Hidden driving forces in systems with multiple observables cannot be detected by scalar statistics.
method Cross-spectral witness for hidden nonequilibrium.
result Two simultaneously observed channels retain an off-diagonal cross-spectral sector inaccessible to scalar reductions.

Proposes a spectral method to assess and combine multiple data visualizations.

problem Evaluating and combining the strengths of different data visualization algorithms.
method Spectral method for assessing and combining multiple visualizations.
result Proposes a visualization eigenscore to quantify relative performance and a consensus visualization.

We develop a latent variable model and an efficient spectral algorithm motivated by the recent emergence of very large data sets of chromatin marks from multiple human cell types. A natural model for chromatin data in one cell type is a Hidden Markov Model (HMM); we model the relationship between multiple cell types by…

2015-06-04abs ↗pdf ↗

Enhancing spectral embedding for low-dimensional embeddings in rare disease cohorts

problem Representing clinical concepts and patients in electronic health records
method Spectral-based unsupervised learning with flexible knowledge transfer
result Outperforms competing approaches in challenging scenarios

The (stochastic) gradient descent and the multiplicative update method are probably the most popular algorithms in machine learning. We introduce and study a new regularization which provides a unification of the additive and multiplicative updates. This regularization is derived from an hyperbolic analogue of the entr…

2019-02-05abs ↗pdf ↗

Optimizes data power control in cell-free networks for better spectral efficiency.

problem Maximizing overall spectral efficiency in cell-free networks with multi-objective optimisation.
method Applied scalable multi-objective Bayesian optimisation to solve convergence-time limitations.
result Improved radio resource management in cell-free networks.

Quantum reservoir computing needs coherence influx for effective information processing.

problem Understanding and optimizing quantum reservoir computing.
method Theoretical and numerical analysis of quantum systems, focusing on coherence influx and spectral radius of Pauli transfer matrix.
result Coherence influx is essential for realizing nonstationary echo state property in quantum reservoir computing.

Researchers prove Seifert-Weber dodecahedral space is an L-space.

problem Proving the Seifert-Weber dodecahedral space is an L-space.
method Relating Floer homology and spectral geometry of hyperbolic three-manifolds, exploiting symmetry and arithmetic structure.
result Small eigenvalues on coexact 1-forms must have large multiplicity in Seifert-Weber dodecahedral space.

We present a novel spectral learning algorithm for simultaneous localization and mapping (SLAM) from range data with known correspondences. This algorithm is an instance of a general spectral system identification framework, from which it inherits several desirable properties, including statistical consistency and no l…

2012-07-10abs ↗pdf ↗

New kernel models multi-output Gaussian processes accurately.

problem Challenges in modelling cross-covariances for multiple-output Gaussian processes.
method Replaced Gaussian components with block components of finite bandwidth in spectral mixture kernel.
result First multi-output generalization of spectral mixture kernel that can approximate any stationary multi-output kernel to arbitrary precision.

Multi-output Gaussian processes (MOGPs) are an extension of Gaussian Processes (GPs) for predicting multiple output variables (also called channels, tasks) simultaneously. In this paper we use the convolution theorem to design a new kernel for MOGPs, by modeling cross channel dependencies through cross convolution of t…

2018-08-07abs ↗pdf ↗

L2SC improves spectral clustering performance by selectively transferring knowledge across tasks.

problem L2SC tackles the challenge of incorporating new spectral clustering tasks without relearning all previous tasks.
method L2SC uses an orthogonal basis library and feature embedding library to selectively transfer knowledge from previously learned tasks to new tasks.
result L2SC outperforms state-of-the-art spectral clustering algorithms on real-world benchmark datasets.

Spectral portfolio theory links neural networks to wealth dynamics via SGD weight matrices.

problem Understanding wealth dynamics from neural network training.
method Direct identification of weight matrices as portfolio allocation matrices, linking SGD forces to portfolio dynamics.
result Spectral properties of SGD weight matrices transition between additive and multiplicative regimes, influencing wealth dynamics.

For generic torus-invariant metrics, eigenspaces are 2D and nodal sets are connected hypersurfaces.

problem Understanding spectral multiplicity and nodal sets for generic torus-invariant metrics.
method Analyzing real ΔgΔ_g-eigenspaces and nodal sets for generic TT-invariant metrics.
result For generic TT-invariant metrics, real ΔgΔ_g-eigenspaces are irreducible and have dimension at most 2, and nodal sets are connected hypersurfaces with specific properties.

Paper proposes a new method for sparse spectral clustering on Stiefel manifold.

problem Sparse spectral clustering on Stiefel manifold with nonsmooth and nonconvex objective.
method Proposes a manifold proximal linear method (ManPL) to solve the original SSC formulation.
result Demonstrates the advantage of ManPL over existing methods on single-cell RNA sequencing data.

Signals consisting of a sequence of pulses show that inherent origin of the 1/f noise is a Brownian fluctuation of the average interevent time between subsequent pulses of the pulse sequence. In this paper we generalize the model of interevent time to reproduce a variety of self-affine time series exhibiting power spec…

2003-03-05abs ↗pdf ↗

This paper analyzes AJIVE for estimating shared subspace across multiple datasets, revealing its strengths and limitations.

problem Estimating shared subspace across multiple datasets with varying degrees of misalignment.
method Angle-based Joint and Individual Variation Explained (AJIVE) method, a two-stage spectral approach.
result AJIVE's performance in high signal-to-noise ratio (SNR) regimes and its non-diminishing error in low-SNR settings.

Improved guarantees and multiple-descent curve for data approximations.

problem Improving the effectiveness of small low-rank approximations of large datasets.
method Spectral properties of the data matrix to obtain improved approximation guarantees.
result Revealed a multiple-descent curve in approximation factor as a function of k.

We present a new description of the spectrum of the (spin-) Dirac operator DD on lens spaces. Viewing a spin lens space LL as a locally symmetric space Γ\Spin(2m)/Spin(2m1)Γ\backslash \operatorname{Spin}(2m)/\operatorname{Spin}(2m-1) and exploiting the representation theory of the Spin\operatorname{Spin} groups, we obtain explicit formu…

2014-12-08abs ↗pdf ↗

A novel nonstationary permanental process relaxes kernel constraints and captures complex data patterns.

problem Limitations of existing permanental processes in terms of kernel types and stationarity.
method Sparse spectral representation of nonstationary kernels and hierarchical stacking of spectral feature mappings.
result Enhanced model expressiveness and reduced computational complexity.

For the multiple differential algebra of iterated differential forms (see math.DG/0605113 and math.DG/0609287) on a diffiety (O,C) an analogue of C-spectral sequence is constructed. The first term of it is naturally interpreted as the algebra of secondary iterated differential forms on (O,C). This allows to develop sec…

2006-10-30abs ↗pdf ↗

Spectral methods improve signal recovery in mixed GLMs with precise asymptotics.

problem Estimating multiple signals from unlabeled observations in mixed GLMs.
method Developed exact asymptotics for spectral methods in a proportional regime.
result Optimized spectral method combined with a linear estimator minimizes estimation error.