New method improves matrix completion accuracy, especially in noisy data.
problem Noisy matrix completion in recommendation systems and signal processing.
method Residual Spectral Matching criterion and pseudo-gradient algorithms.
result Improved numerical performance in noisy data environments.
The paper derives spectral (0,4)-tensor functionals using the noncommutative residue.
problem Deriving spectral (0,4)-tensor functionals on compact spin manifolds.
method Using four one-forms and the Dirac operator, the noncommutative residue is applied to even-dimensional compact spin manifolds.
result Spectral (0,4)-tensor functionals are extended to a general spectral triple.
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.
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.
Promotes spectral functionals to noncommutative fields and proves a theorem.
problem Spectral functionals on noncommutative fields and manifolds with boundary.
method Carries out promotion to spectral functionals, associates with noncommutative residue, and proves theorem.
result Proves Dabrowski-Sitarz-Zalecki type theorem for statistical de Rham Hodge operators on manifolds with boundary.
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.
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.
PRISMA uses PDE residuals for fast, robust, and accurate inference.
problem Slow gradient-based optimization and instability in PDE residual-based methods.
method Integrates PDE residuals directly into the model's architecture via attention mechanisms in the spectral domain.
result Competitive accuracy with significantly lower inference costs and faster speeds.
Defines spectral Einstein functionals for sub-Dirac operators on manifolds with boundary.
problem Calculating Einstein-like functionals for sub-Dirac operators.
method Introduced spectral Einstein functional for sub-Dirac operators on manifolds with boundary.
result Proved a theorem for spectral Einstein functions on four-dimensional manifolds.
Study spectral functionals on manifolds with torsion.
problem Extending classical results to geometries with torsion.
method Using Wodzicki residue, investigate spectral functionals of Dirac and Laplace-type operators.
result Local densities recover fundamental geometric tensors.
Researchers compute a residue cocycle for Dirac-type operators using modified Getzler calculus.
problem Computing the residue cocycle for Dirac-type operators.
method Modified Getzler calculus for computation.
result Computed residue cocycle for a class of Dirac-type operators.
The paper proves geometric and spectral alignment for deep neural networks.
problem Understanding the singular spectra of deep neural network layers.
method Proves deterministic quotient-geometric estimates for singular spectra of Frobenius-normalized layer factors.
result Exact power-law spectra form a trace-normalized Cartan orbit under Frobenius normalization.
Let P be a non-negative self-adjoint Laplace type operator acting on sections of a hermitian vector bundle over a closed Riemannian manifold. In this paper we review the close relations between various P-related coefficients such as the mollified spectral counting coefficients, the heat trace coefficients, the reso…
The paper defines a new functional and proves related theorems for manifolds with boundary.
problem Defining and proving theorems for manifolds with boundary.
method Defining the spectral Einstein functional and relating it to the noncommutative residue.
result Proof of Dabrowski-Sitarz-Zalecki type theorems for spectral Einstein functional on 4D manifolds with boundary.
The canonical trace and the Wodzicki residue on classical pseudodifferential operators on a closed manifold are characterised by their locality and shown to be preserved under lifting to the universal covering as a result of their local feature. As a consequence, we lift a class of spectral ζ-invariants using lifted …
Examines a new type of analytic torsion on Riemannian manifolds.
problem Analyzing a new trace formula for Riemannian manifolds.
method Uses residue-trace instead of spectral zeta function quasi-trace.
result Defines and examines the residue analytic torsion.
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 study conformal Spin-subgeometry of submanifolds in a semi-Riemannian Spin-manifold, focusing on conformal Spin-manifolds (M,[h]) and their Poincaré-Einstein metrics (X,g+). Our approach is based on the spectral theory of Dirac operator in the ambient Spin-manifold, and associated spinor valued meromorp…
MLP residual networks implement a selective coarse-graining procedure governed by the spectral structure of the input distribution.
problem Understanding the coarse-graining procedure in MLP residual networks
method Analyzing a pure MLP residual stack on synthetic Markov chain sequences
result MLP residual networks implement a selective coarse-graining procedure governed by the spectral structure of the input distribution
A novel 3D shape registration method using spectral graph embedding and probabilistic matching.
problem Challenges in 3D shape analysis and registration, especially with large variability.
method Combining spectral graph matching with Laplacian embedding for large graphs, using commute-time embedding and PCA.
result A method to register shapes with different samplings and isometric deformations.
Improved real-time UAV terrain following with RVM-RLS filter.
problem Accurate real-time waypoints estimation under measurement noise in nonlinear, time-varying systems.
method Residual Variance Matching Recursive Least Squares (RVM-RLS) filter guided by RVME criterion.
result Improved waypoints estimation accuracy by approximately 88% compared to benchmarks.
Defines spectral Einstein functional for manifolds with boundary.
problem Calculating the spectral Einstein functional for manifolds with boundaries.
method Defined spectral Einstein functional associated with the Dirac operator and proved a theorem for 4D manifolds.
result Proof of Kastler-Kalau-Walze type theorem for spectral Einstein functional.
The paper introduces spectral Einstein functionals for Dirac operators on manifolds with boundary.
problem Analyzing perturbations of Dirac operators on manifolds with boundary.
method Introduction of spectral Einstein functionals and proof of Dabrowski-Sitarz-Zalecki type theorems.
result Proof of theorems associated with spectral Einstein functionals for perturbations of Dirac operators.
Study of η invariants on lens spaces detects distinctions invisible to ordinary η.
problem Detecting distinctions in η invariants on lens spaces. method Spin-Fourier residues and equivariant η invariants. result Second derivative of the residual η germ is nonzero for some lens spaces. This work proposes a novel autoencoder for fusing visible and infrared images.
problem Challenging task to combine spatial and spectral information from visible and infrared images.
method Spatially constrained adversarial autoencoder with residual architecture and adversarial regularizer.
result Generates a more realistic fused image with enhanced spatial and spectral information.
The paper introduces a trilinear functional to recover torsion in spectral triples.
problem Recovering torsion in noncommutative spectral triples.
method Introduces a trilinear functional for spectral triples and demonstrates its application to recover torsion.
result The trilinear functional recovers the torsion of the linear connection in canonical spectral triples.
Unified spectral framework for μP under joint width-depth scaling.
problem Challenges in stable feature learning and HP transfer for width-depth scaled models.
method Developed a simple and unified spectral framework for μP under joint width-depth scaling.
result Unified and generalized μP formulation for practical architectures with multi-transformation branches.
We present a parallelized bijective graph matching algorithm that leverages seeds and is designed to match very large graphs. Our algorithm combines spectral graph embedding with existing state-of-the-art seeded graph matching procedures. We justify our approach by proving that modestly correlated, large stochastic blo…
The paper explores a new method for landmark matching using sub-Riemannian geometry and neural networks.
problem Finding a time-dependent vector field to warp points from an initial set to a target set.
method Sub-Riemannian geometry and residual neural networks.
result Demonstrates the importance of regularization in landmark matching.
New method learns PDE solutions from low-fidelity data.
problem Challenges in learning PDE surrogates with scarce data.
method Flow matching in infinite-dimensional space with conditional neural operators.
result Accurately learns PDE solutions across different resolutions and fidelities.
In this paper we study the spectral asymmetry of (possibly nonselfadjoint) elliptic PsiDO's in terms of the difference of zeta functions coming from different cuttings. Refining previous formulas of Wodzicki in the case of odd class elliptic PsiDO's, our main results have several consequence concerning the local indepe…
GRRT recovers sparse signals without prior sparsity or noise variance knowledge.
problem Recovering sparse signals without prior sparsity or noise variance knowledge.
method Generalized residual ratio thresholding (GRRT) for SOMP and BOMP.
result Finite sample and finite SNR guarantees for exact support recovery.
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.
KBB algorithm reduces sample complexity for policy evaluation in general state spaces.
problem Policy evaluation in large state spaces with high sample complexity.
method Alternates between fitting Bellman residual and estimating value function via adaptive feature set growth.
result Super-linear convergence rates demonstrated, with reductions in sample complexity.
New learning-based methods improve spectral efficiency in mmWave full-duplex systems.
problem Residual self-interference and high pathloss in mmWave full-duplex systems.
method Proposed two learning schemes (ELM-HBF and CNN-HBF) using ADMM and MM algorithms for SI cancellation and joint HBF optimization.
result Learning-based schemes achieve at least 22.1% higher spectral efficiency and faster online prediction and training times.
Deep learning enhances options hedging performance.
problem Improving delta hedging for options using neural networks.
method Learning residuals between hedging function and implied Black-Scholes delta using neural networks.
result Deep learning significantly improves hedging performance, often by more than 100%.
Proposes RaT to mitigate bias in student-teacher estimation.
problem Systematic bias in teacher's predictions propagates to student model.
method Uses teacher to estimate residuals in student's predictions.
result RaT method reduces teacher bias effect and achieves optimal rate.
Graph matching aims at finding the vertex correspondence between two unlabeled graphs that maximizes the total edge weight correlation. This amounts to solving a computationally intractable quadratic assignment problem. In this paper we propose a new spectral method, GRAph Matching by Pairwise eigen-Alignments (GRAMPA)…
A wide variety of application domains are concerned with data consisting of entities and their relationships or connections, formally represented as graphs. Within these diverse application areas, a common problem of interest is the detection of a subset of entities whose connectivity is anomalous with respect to the r…
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
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.
Given a compact Kaehler manifold, we consider the complement U of a divisor with normal crossings and a unitary local system V on it. We consider a differential graded Lie algebra (DGLA) of forms with holomorphic logarithmic singularities and vanishing residues. We construct a spectral sequence corresponding to the ant…
Paper proposes a new method for training diffusion models using Markov operators.
problem Training efficiency and accuracy in diffusion models.
method Operator-informed score matching using spectral decomposition of Markov operators.
result Improved score matching for both low and high-dimensional distributions.
Theoretical limits of deep residual networks show consistent covariance structures.
problem Understanding the limits of deep residual networks.
method Analyzing the behavior of deep residual networks with skip connections as width and depth approach infinity.
result Theoretical analysis confirms that the covariance structure remains consistent regardless of the order of width and depth.
A new method resolves permutation issues in shuffled linear regression for large-scale applications.
problem Estimating latent features through linear transformation with unknown permutations.
method Spectral matching method to align spectral components of measurement and feature covariances.
result Achieves accurate estimates in shuffled LS and LASSO settings with sufficient samples.
Proves curvature of conference graphs and finds local matchings.
problem Proving precise values of curvature in conference graphs.
method Combining parameter relations and combinatorial approach.
result Existence of local perfect matchings in broader classes of graphs.
Paper proves noise-tolerant SSC using greedy methods under coherence conditions.
problem Proving noise-tolerant SSC using greedy methods under coherence conditions.
method Derives coherence-based sufficient conditions for correct neighbor identification using MP/OMP in the presence of bounded noise.
result MP/OMP succeed in identifying correct neighbors under certain noise levels, leading to higher clustering accuracy.
Fast nonparametric conditional independence testing via two-stage regression
problem Fast nonparametric conditional independence testing
method BLITZ (Broad-to-Local Independence Testing via residualiZation)
result Better null calibration than fast kernel, random-feature, and regression-based competitors