arXiv Machine Learning July 7, 2026 By Varvara Nazarenkko, Timur Lidzhiev, Alexander Tarakanov

PIEFS: Physics-Informed Eigenfunction Features with Learnable Scaling

Read the original on arXiv Machine Learning →

arXiv:2607. 03692v1 Announce Type: new Abstract: Spectral methods are widely used to construct representations from the geometry of data, but they often rely on a fixed kernel, graph Laplacian, or manually selected feature scaling.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Machine Learning

Jun 16

Spectral Analysis of Molecular Features: When Richer Features Do Not Guarantee Better Generalization

arXiv:2510. 14217v2 Announce Type: replace Abstract: The spectral properties of feature embeddings offer critical insights into model generalization and representation quality.

By Asma Jamali, Tin Sum Cheng, Rodrigo A. Vargas-Hern\'andez

llms rag benchmarks

arXiv AI

4d ago

Neural networks for spectral optimization

arXiv:2609.36047v1 Announce Type: cross Abstract: Given a functional dependent on the spectrum of a differential operator, we address the problem of finding a domain which optimizes this functional....

By Alexis de Villeroch\'e, Beniamin Bogosel, St\'ephane Breuils, Dorin Bucur, Jacques-Olivier Lachaud

arXiv Machine Learning

Aug 31

Beyond Pairwise Graphs in Science: Hypergraph Adaptive Wavelet Operators for Parametric PDEs

arXiv:2608.27883v1 Announce Type: new Abstract: Physical systems are often modeled by solution operators that map input fields, parameters, geometries, or past states to steady or future physical sta...

By Rajat Sarkar, Venkataramana Runkana, Souvik Chakraborty

llms benchmarks

arXiv Machine Learning

Jun 30

Robust Tangent Space Estimation via Laplacian Eigenvector Gradient Orthogonalization

arXiv:2510. 02308v2 Announce Type: replace Abstract: Estimating the tangent spaces of a data manifold is a fundamental problem in geometric data analysis.

By Dhruv Kohli, Sawyer J. Robertson, Gal Mishne, Alexander Cloninger

arXiv AI

Jun 10

Learning-Guided Integration Contours Construction for Fast Large-Scale Generalized Eigensolvers

arXiv:2511. 01927v2 Announce Type: replace-cross Abstract: Solving large-scale Generalized Eigenvalue Problems (GEPs) is a fundamental yet computationally prohibitive task in science and engineering.

By Yeqiu Chen, Ziyan Liu, Hong Wang, Lei Liu

arXiv AI

Jul 16

Spectral-Informed Neural Networks Outperform Spectral Methods in High-dimensional PDEs

arXiv:2607. 13566v1 Announce Type: cross Abstract: For low-dimensional problems ($d\leq3$), spectral methods can achieve exceptionally high accuracy.

By Tianchi Yu, Ivan Oseledets

rag

One email a morning, machine-written

Related stories

Spectral Analysis of Molecular Features: When Richer Features Do Not Guarantee Better Generalization

Neural networks for spectral optimization

Beyond Pairwise Graphs in Science: Hypergraph Adaptive Wavelet Operators for Parametric PDEs

Robust Tangent Space Estimation via Laplacian Eigenvector Gradient Orthogonalization

Learning-Guided Integration Contours Construction for Fast Large-Scale Generalized Eigensolvers

Spectral-Informed Neural Networks Outperform Spectral Methods in High-dimensional PDEs