Paper proves new theorems about curvature in weighted manifolds.
problem Understanding curvature in weighted manifolds.
method Proved spectral comparison and splitting theorems for infinity-Bakry-Emery Ricci curvature.
result Results extend existing theorems and provide new supplements.
Spectral Adaptive Conformal Prediction for Structured Non-Exchangeable Data
problem Improving prediction intervals for non-exchangeable time-indexed datasets
method Spectral adaptive conformal prediction
result Improves on fixed spectral weighting while monitoring uncertainty changes
Spectral algorithms improve under covariate shift with novel weighted techniques.
problem Improving spectral algorithms' performance under covariate shift.
method Analysis of spectral algorithms in non-parametric regression over RKHS, proposing a weighted spectral algorithm with clipped weights.
result Normalized weighted spectral algorithm achieves optimal capacity-independent convergence rates, and clipped weights can approach optimal capacity-dependent rates.
The paper develops heat kernel comparison theorems and applies them to spectral geometry.
problem Developing mathematical tools for spectral geometry.
method Established weighted heat kernel comparison theorems for manifolds with bounded radial curvatures.
result Two eigenvalue comparison theorems for the first Dirichlet eigenvalue of the Witten-Laplacian.
We present a novel spectral embedding of graphs that incorporates weights assigned to the nodes, quantifying their relative importance. This spectral embedding is based on the first eigenvectors of some properly normalized version of the Laplacian. We prove that these eigenvectors correspond to the configurations of lo…
When analyzing weighted networks using spectral embedding, a judicious transformation of the edge weights may produce better results. To formalize this idea, we consider the asymptotic behavior of spectral embedding for different edge-weight representations, under a generic low rank model. We measure the quality of dif…
Positive weights improve kernel quadrature's accuracy.
problem Improving kernel quadrature weights to be positive and stable.
method Using convex geometry to approximate the kernel mean embedding with positive weights.
result Positive weights lead to improved kernel quadrature bounds with Monte-Carlo-beating rates.
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.
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.
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 develops a new theory for ensemble learning beyond variance reduction.
problem Ensemble learning's effectiveness for stable estimators is not fully explained by variance reduction.
method Develops a general weighting theory for ensemble learning, formalizing ensembles as linear operators and introducing geometric and spectral constraints.
result Structured weights can outperform uniform averaging by reshaping approximation geometry and redistributing spectral complexity.
New method clusters weighted directed networks using motifs.
problem Clustering directed networks fails to consider higher-order structure and edge weights.
method Motif-based weighted spectral clustering with new matrix formulae.
result Scalable and effective clustering on large graphs and real-world data.
Despite excellent progress in recent years, mode collapse remains a major unsolved problem in generative adversarial networks (GANs).In this paper, we present spectral regularization for GANs (SR-GANs), a new and robust method for combating the mode collapse problem in GANs. Theoretical analysis shows that the optimal …
New method estimates Nishimori temperature for node classification in weighted graphs.
problem Estimating Nishimori temperature for Bayesian inference.
method Spectral method using eigenvalues of Bethe Hessian matrix.
result Spectral method outperforms existing approaches in node classification.
A theory of feature geometry using spectral analysis of weight matrices.
problem Current methods decompose neural network activations into sparse linear features, losing geometric structure.
method Develops a theory by analyzing the spectra of weight-derived matrices, introducing the frame operator.
result Features collapse onto single eigenspaces, organizing into tight frames, and admit discrete classification.
Novel Haar-Laplacian for directed graphs enhances spectral graph applications.
problem Lack of suitable Laplacian for directed graphs in spectral graph theory.
method Inspired by Haar-like transformation, introduces a Hermitian matrix preserving direction and weight.
result HaarNet outperforms in weight prediction and denoising on directed graphs.
We study the inverse spectral problem for weighted projective spaces using wave-trace methods. We show that in many cases one can "hear" the weights of a weighted projective space.
The paper extends spin geometry to weighted manifolds and defines a new mass for Ricci flow.
problem Generalizing spin geometry to weighted manifolds and defining a new mass.
method Investigates spectral properties of the weighted Dirac operator and defines a new mass.
result Defines a new mass for weighted asymptotically Euclidean manifolds and shows its monotonicity under Ricci flow.
Under a spectral assumption on the Laplacian of a Poincaré--Einstein manifold, we establish an energy inequality relating the energy of a fractional GJMS operator of order 2γ∈(0,2) or 2γ∈(2,4) and the energy of the weighted conformal Laplacian or weighted Paneitz operator, respectively. This spectral assumption…
We define a class of Euclidean distances on weighted graphs, enabling to perform thermodynamic soft graph clustering. The class can be constructed form the "raw coordinates" encountered in spectral clustering, and can be extended by means of higher-dimensional embeddings (Schoenberg transformations). Geographical flow …
Study heavy-tailed weights' impact on neural network's spectral distribution.
problem Analyzing spectral distribution of conjugate kernel matrices with heavy-tailed weights.
method Computed limiting eigenvalue distribution through moments, considering heavy-tailed distributions and nonlinear activation functions.
result Heavy-tailed weights induce strong correlations, leading to fundamentally different spectral behavior.
This paper proposes a discrimination technique for vertices in a weighted network. We assume that the edge weights and adjacencies in the network are conditionally independent and that both sources of information encode class membership information. In particular, we introduce a edge weight distribution matrix to the s…
The study examines Fisher information matrices and neural tangent kernels for simple ReLU networks with random weights.
problem Understanding the relationship between Fisher information matrices and neural tangent kernels for 2-layer ReLU networks.
method Analyzes Fisher information matrices and neural tangent kernels for 2-layer ReLU networks with random hidden weights, focusing on spectral decomposition and eigenfunctions.
result Obtained an approximation formula for functions represented by 2-layer neural networks.
New proof of splitting theorem and finite ends of minimal hypersurfaces in nonnegative curvature manifolds.
problem Proving splitting theorem and finite ends of minimal hypersurfaces in nonnegative curvature manifolds.
method New proof of splitting theorem and construction of weighted minimizing geodesics at infinity.
result Minimal hypersurfaces with finite index in manifolds with nonnegative biRic curvature must have finite ends.
Study identifies cancer genes through graph anomaly analysis of protein interactions.
problem Insufficient modeling of biological information in protein interaction networks for cancer gene identification.
method Proposes HIerarchical-Perspective Graph Neural Network (HIPGNN) to detect weight heterogeneity and spectral flattening in cancer gene nodes.
result HIPGNN detects weight heterogeneity and spectral flattening, leading to improved cancer gene identification.
Improved spectral clustering for community detection in networks.
problem Community detection in networks.
method Improved spectral clustering (ISC) based on k-means clustering on weighted eigenvectors of a regularized Laplacian matrix.
result ISC yields stable consistent community detection under mild conditions and outperforms classical methods.
Study compares spectral properties of a specific tensor in geometry.
problem Comparing spectral properties of a specific tensor in geometry.
method Diameter and global weighted volume comparison with a positive lower bound on the N-Bakry-Emery Ricci tensor. result Established diameter and volume comparisons for tensors with positive lower bounds.
Hypergraphs are used in machine learning to model higher-order relationships in data. While spectral methods for graphs are well-established, spectral theory for hypergraphs remains an active area of research. In this paper, we use random walks to develop a spectral theory for hypergraphs with edge-dependent vertex wei…
S-GAI initializes MLPs using spectral geometry from data, improving performance.
problem Lack of guidance on initial weights encoding data geometry.
method S-GAI uses SVD to estimate spectral class geometry, initializing MLPs from training data.
result S-GAI-initialized MLPs start from a more informative hidden state and achieve comparable accuracy.
The paper validates Stokes' theorem for differential subcomplexes in positively graded Lie groups.
problem Validating Stokes' theorem for differential subcomplexes in positively graded Lie groups.
method Introducing geometric conditions and spectral complexes to recover Stokes' theorem on locally smooth intrinsic graphs.
result Stokes' theorem holds for Rumin complex and new spectral complexes on Carnot groups.
We prove inverse spectral results for differential operators on manifolds and orbifolds invariant under a torus action. These inverse spectral results involve the asymptotic equivariant spectrum, which is the spectrum itself together with "very large" weights of the torus action on eigenspaces. More precisely, we show …
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.
The paper explores rigidity theorems for spectral curvature bounds in 3-manifolds.
problem Classical rigidity results in scalar curvature geometry are extended to the spectral setting.
method Warped μ-bubble method is systematically employed to classify stable weighted minimal hypersurfaces and establish band width estimates. result Classification theorems and band width estimates for spectral Ricci and scalar curvatures are proven.
Dirichlet-Neumann duality for Riemannian submersions
problem Spectral geometry of Riemannian submersions
method Summation formula for reciprocal of basic Dirichlet eigenvalues
result Supersymmetric duality between basic Dirichlet and Neumann spectra
Study shows how certain metrics can be split into warped products.
problem Understanding conditions under which metrics can be split as warped products.
method Investigating warped area-minimizing hypersurfaces and spectral Ricci/scalar curvature bounds.
result Metrics can be locally split as warped products under specific curvature conditions.
Study uses spectral risk for learning with heavy-tailed data.
problem Learning with heavy-tailed loss distributions.
method Spectral risk with Lipschitz-continuous density, derivative-free learning.
result Excess risk guarantees and improved performance over traditional methods.
New matrix ensembles better match deep neural network spectral densities.
problem Theoretical spectral density models for deep networks do not match empirical observations.
method Introduced new matrix ensemble classes to better fit observed spectral densities.
result Theoretical models for deep networks are significantly flawed.
Spectral clustering is a celebrated algorithm that partitions objects based on pairwise similarity information. While this approach has been successfully applied to a variety of domains, it comes with limitations. The reason is that there are many other applications in which only \emph{multi}-way similarity measures ar…
This paper proves a generalization bound for complex-valued neural networks scaling with spectral complexity.
problem Ensuring the performance of complex-valued neural networks on unseen data.
method Theoretical derivation using Maurey Sparsification Lemma and Dudley Entropy Integral, empirical validation on various datasets.
result The spectral complexity of weight matrices is a significant factor in the generalization ability of complex-valued neural networks.
In this paper we study the asymptotic behavior of second-order uniformly elliptic operators on weighted Riemannian manifolds. They naturally emerge when studying spectral properties of the Laplace-Beltrami operator on families of manifolds with rapidly oscillating metrics. We appeal to the notion of H-convergence intro…
We study topological recursion on the irregular spectral curve xy2−xy+1=0, which produces a weighted count of dessins d'enfant. This analysis is then applied to topological recursion on the spectral curve xy2=1, which takes the place of the Airy curve x=y2 to describe asymptotic behaviour of enumerative proble…
Improved spectral convergence bounds for diffusion maps on tori.
problem Weak theoretical error bounds for diffusion maps.
method Spatial Hardy space estimates, PDE spectral stability, Sinkhorn weights.
result Matched pointwise error bounds for spectral data and operator convergence.
The paper distills a weighted automaton from RNNs for language modeling.
problem Tackles the gap between deep learning and grammatical inference.
method Uses a spectral approach to infer a weighted automaton from a trained RNN.
result Extracted weighted automata are good approximations of the RNNs, validating the approach.
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…
A new model for detecting overlapping communities in weighted networks.
problem Community detection in overlapping weighted networks with mixed membership and edge weights.
method Mixed membership distribution-free (MMDF) model with an efficient spectral algorithm and fuzzy weighted modularity.
result The MMDF model can estimate community memberships and evaluate community quality for weighted networks.
The study reveals the spectral structure of attention layers and its implications for generalization.
problem Understanding the spectral structure and generalization of trained attention layers.
method Empirical risk minimization in a single-head tied-attention layer, using random matrix theory, spin-glass theory, and approximate message passing.
result Exact high-dimensional characterization of training and test error, interpolation and recovery thresholds, and spectrum of the key and query matrices.
Proposes a deep network for multi-class classification using spectral training and Gaussian kernel.
problem Multi-class classification with deep networks.
method Spectral training with linear weights and Gaussian kernel activation, constrained on Stiefel Manifold.
result Theoretical guarantee of global optimum and insight into network generalization.
Defines spectral selectors on lens spaces for contactomorphisms.
problem Understanding the geometry of contactomorphism groups on lens spaces.
method Using Givental's non-linear Maslov index, defines spectral selectors.
result Standard Reeb flow is a geodesic for specific lens spaces.