Spectral Path Regression: Directional Chebyshev Harmonics for Interpretable Tabular Learning

• URL: http://arxiv.org/abs/2604.04091v1
• Date: Sun, 05 Apr 2026 12:13:59 GMT
• Title: Spectral Path Regression: Directional Chebyshev Harmonics for Interpretable Tabular Learning
• Abstract summary: We replace tensorised oscillations with directional harmonic modes of the form $cos(mathbfmtoparccos(mathbfx)$.<n>This representation yields a discrete spectral regression model in which complexity is controlled by selecting a small number of structured frequency vectors.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Classical approximation bases such as Chebyshev polynomials provide principled and interpretable representations, but their multivariate tensor-product constructions scale exponentially with dimension and impose axis-aligned structure that is poorly matched to real tabular data. We address this by replacing tensorised oscillations with directional harmonic modes of the form $\cos(\mathbf{m}^{\top}\arccos(\mathbf{x}))$, which organise multivariate structure by direction in angular space rather than by coordinate index. This representation yields a discrete spectral regression model in which complexity is controlled by selecting a small number of structured frequency vectors (spectral paths), and training reduces to a single closed-form ridge solve with no iterative optimisation. Experiments on standard continuous-feature tabular regression benchmarks show that the resulting models achieve accuracy competitive with strong nonlinear baselines while remaining compact, computationally efficient, and explicitly interpretable through analytic expressions of learned feature interactions.

Related papers

• Sparse Orthogonal Regression Technique: A Spectral Framework for Equation Discovery, Approximation, and Integration [4.389213808289583]
  We develop a sparse framework for learning orthonormal-basis expansions from noisy and irregularly sampled data.<n>SORT estimates expansion coefficients using L1-regularized regression, avoiding explicit quadrature or analytic inner-product evaluation.<n>The central application is data-driven discovery of ordinary differential equations.
  arXiv  Detail & Related papers  (2026-08-13T17:31:27Z)
• Variational (Energy-Based) Spectral Learning: A Machine Learning Framework for Solving Partial Differential Equations [0.0]
  We introduce variational spectral learning (VSL), a machine learning framework for solving partial differential equations (PDEs)<n>VSL offers a principled bridge between variational PDE theory, spectral discretization, and contemporary machine learning practice.
  arXiv  Detail & Related papers  (2026-01-05T19:03:58Z)
• Generalized Nonnegative Structured Kruskal Tensor Regression [22.300007523556022]
  Generalized Nonnegative Structured Kruskal Regression (NS-KTR) is a novel tensor regression framework.<n>It enhances interpretability and performance through mode-specific hybrid regularization and nonnegativity constraints.
  arXiv  Detail & Related papers  (2025-09-24T08:51:38Z)
• Loss-Complexity Landscape and Model Structure Functions [53.92822954974537]
  We develop a framework for dualizing the Kolmogorov structure function $h_x(alpha)$.<n>We establish a mathematical analogy between information-theoretic constructs and statistical mechanics.<n>We explicitly prove the Legendre-Fenchel duality between the structure function and free energy.
  arXiv  Detail & Related papers  (2025-07-17T21:31:45Z)
• Score-Based Model for Low-Rank Tensor Recovery [49.158601255093416]
  Low-rank tensor decompositions (TDs) provide an effective framework for multiway data analysis.<n>Traditional TD methods rely on predefined structural assumptions, such as CP or Tucker decompositions.<n>We propose a score-based model that eliminates the need for predefined structural or distributional assumptions.
  arXiv  Detail & Related papers  (2025-06-27T15:05:37Z)
• Interpretable Representation Learning for Additive Rule Ensembles [6.753916556870879]
  Small additive ensembles of symbolic rules offer interpretable prediction models.<n>We extend classical rule ensembles by introducing learnable sparse linear transformations of input variables.<n>We propose a learning method using sequential greedy optimization based on an iteratively reweighted formulation of logistic regression.
  arXiv  Detail & Related papers  (2025-06-26T01:24:08Z)
• Gradient-Based Feature Learning under Structured Data [57.76552698981579]
  In the anisotropic setting, the commonly used spherical gradient dynamics may fail to recover the true direction. We show that appropriate weight normalization that is reminiscent of batch normalization can alleviate this issue. In particular, under the spiked model with a suitably large spike, the sample complexity of gradient-based training can be made independent of the information exponent.
  arXiv  Detail & Related papers  (2023-09-07T16:55:50Z)
• Learning Graphical Factor Models with Riemannian Optimization [70.13748170371889]
  This paper proposes a flexible algorithmic framework for graph learning under low-rank structural constraints. The problem is expressed as penalized maximum likelihood estimation of an elliptical distribution. We leverage geometries of positive definite matrices and positive semi-definite matrices of fixed rank that are well suited to elliptical models.
  arXiv  Detail & Related papers  (2022-10-21T13:19:45Z)
• Joint Network Topology Inference via Structured Fusion Regularization [70.30364652829164]
  Joint network topology inference represents a canonical problem of learning multiple graph Laplacian matrices from heterogeneous graph signals. We propose a general graph estimator based on a novel structured fusion regularization. We show that the proposed graph estimator enjoys both high computational efficiency and rigorous theoretical guarantee.
  arXiv  Detail & Related papers  (2021-03-05T04:42:32Z)
• Efficient Semi-Implicit Variational Inference [65.07058307271329]
  We propose an efficient and scalable semi-implicit extrapolational (SIVI) Our method maps SIVI's evidence to a rigorous inference of lower gradient values.
  arXiv  Detail & Related papers  (2021-01-15T11:39:09Z)
• Tight Nonparametric Convergence Rates for Stochastic Gradient Descent under the Noiseless Linear Model [0.0]
  We analyze the convergence of single-pass, fixed step-size gradient descent on the least-square risk under this model. As a special case, we analyze an online algorithm for estimating a real function on the unit interval from the noiseless observation of its value at randomly sampled points.
  arXiv  Detail & Related papers  (2020-06-15T08:25:50Z)
• Stochastic spectral embedding [0.0]
  We propose a novel sequential adaptive surrogate modeling method based on "stochastic spectral embedding" (SSE) We show how the method compares favorably against state-of-the-art sparse chaos expansions on a set of models with different complexity and input dimension.
  arXiv  Detail & Related papers  (2020-04-09T11:00:07Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.