Optimal Multiscale Learning of Linear Operators

86d ago · Global · primary source: export.arxiv.org

Multi-source synthesis by The Embedding Report from 2 sources. Every numeric and quoted claim traces to a cited source body (see methodology).

Two recent studies on arXiv explore the limits of learning linear operators and physical learning methods in linear circuits, shedding light on the challenges and opportunities in these areas.

A study submitted on June 15, 2026, examines the statistical and computational limits of learning bounded linear operators between Sobolev spaces from noisy data[1]. The researchers recast the problem as an infinite-dimensional matrix regression problem in wavelet coordinates and constructed a finite-resolution blockwise least-squares estimator to achieve minimax rates. The analysis reveals a nonuniform local estimation difficulty across scales. Another study on arXiv, submitted around the same time, investigates the coercivity and local convergence of physical learning methods in linear circuits[2]. The researchers analyzed methods such as Equilibrium Propagation (EP), Adjoint Coupled Learning (AL), and Coupled Learning (CL), finding that EP and AL perform gradient descent on a natural loss function, while CL follows modified dynamics with an additional cubic correction. A coercivity condition was identified, expressed as a rank condition on a matrix built from the network's incidence structure.

research-papercommentary

Background sources we checked (6)
  • arxiv.org ↗ We study the statistical and computational limits of learning bounded linear operators between Sobolev spaces from noisy input-output data. In wavelet coordinates, the problem is recast as an infinite-dimensional matrix regression problem with a heterogeneous two-sided multiscale…
  • arxiv.org ↗ We study the statistical and computational limits of learning bounded linear operators between Sobolev spaces from noisy input–output data. In wavelet coordinates, the problem is recast as an infinite-dimensional matrix regression problem with a heterogeneous two-sided multiscale…
  • openreview.net ↗ Minimax Optimal Kernel Operator Learning via Multilevel Training | OpenReview ## Minimax Optimal Kernel Operator Learning via Multilevel Training ICLR 2023 notable top 25%Readers: Everyone Abstract: Learning mappings between infinite-dimensional function spaces have achieved e…
  • arxiv.org ↗ Minimax Optimal Kernel Operator Learning via ... multi-agent reinforcement ... . In this paper, we ... show that a ... ones that above the variance ... . At the same ... feasible machine learning algorithms. Based on this observation, we develop a multilevel kernel operator ... l…
  • en.wikipedia.org ↗ Monte Carlo methods, also called the Monte Carlo experiments or Monte Carlo simulations, are a broad class of computational algorithms based on repeated random sampling for obtaining numerical results, conceptualized by Polish mathematician Stanisław Ulam. The underlying concept …
  • en.wikipedia.org ↗ Locally Optimal Block Preconditioned Conjugate Gradient (LOBPCG) is a matrix-free method for finding the largest (or smallest) eigenvalues and the corresponding eigenvectors of a symmetric generalized eigenvalue problem A x = λ …

Sources cited (2)

  1. arxiv.org ↗ E
  2. arxiv.org ↗ E
Spot something wrong? Report an issue