Functional Attentive Interpretable Regression

• URL: http://arxiv.org/abs/2609.05846v1
• Date: Sat, 05 Sep 2026 03:22:31 GMT
• Title: Functional Attentive Interpretable Regression
• Abstract summary: In function-on-function regression, the coefficient surface $(s,t)$ may exhibit complex support structure.<n>We propose Functional Attentive Interpretable Regression (FAIR), which represents $(s,t)$ directly through coordinate features and uses self-attention to learn effect-adaptive neighborhoods.
• Score: 0.7136933021609079
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In function-on-function regression, the coefficient surface $β(s,t)$ may exhibit complex support structure---from localized patches to global patterns such as disconnected regions, bands, or rings---where effect similarity does not align with Euclidean proximity. Projection-based methods that rely on fixed basis expansions can obscure such structure, while direct smoothing approaches risk oversmoothing the surface and its boundaries. We propose Functional Attentive Interpretable Regression (FAIR), which represents $β(s,t)$ directly through coordinate features and uses self-attention to learn effect-adaptive neighborhoods, enabling information sharing at both local and global scales. A scalar compression network maps these learned representations to the coefficient surface. Sparsity and smoothness penalties applied over these neighborhoods promote localized support with coherent boundaries. We establish a sieve equivalence to tensor-product spline spaces and derive convergence rates. Simulations and applications to oceanographic and hydrological data demonstrate that FAIR recovers support geometry more accurately than existing methods while achieving superior prediction, particularly under sparse sampling.

Related papers

• Curvature-Aware Radius Shrinkage for Adaptive Nearest Neighbor Classification [52.452902154360565]
  CARSANN is a geometry-driven framework that adapts the spatial support of each neighborhood according to local geometric complexity.<n>Experiments on more than 70 real-world OpenML datasets show that CARSANN consistently improves upon standard $k$-NN.
  arXiv  Detail & Related papers  (2026-08-27T19:19:07Z)
• Across the Loss Landscape with Progressive Growth [51.366966420881646]
  We show how grow-and-optimize strategies to train toward flatter regions by viewing growth as progressive relaxation.<n>We empirically validate these predictions in controlled toy basins and in a realistic ResNet/CI-100 setting.<n>Although progressive subspace growth reliably produces flatter solutions, curvature reductions do not universally translate into improved test performance, highlighting subtleties in the flatness-generalization connection.
  arXiv  Detail & Related papers  (2026-08-25T13:50:48Z)
• A Deep Learning Model for Spatially Clustered Data via Differentiable Cluster Assignment [2.5782420501870296]
  A nonparametric estimator is proposed to learn the partition and the cluster-specific regression functions jointly.<n>A real data analysis is provided to demonstrate the validity and effectiveness of the proposed method.
  arXiv  Detail & Related papers  (2026-08-15T01:39:56Z)
• Sheaf-Based Federated Representation Learning [11.430396441085579]
  Sheaf-based Federated Representation Learning (SFRL)<n>We develop a decentralized algorithm for solving SFRL, termed Sheaf-FRL, which alternates between gradient updates of the local models and closed-form Procrustes updates of the edge-wise restriction maps.<n>As an application, we consider a cooperative classification task in the context of semantic communication.
  arXiv  Detail & Related papers  (2026-08-08T16:38:34Z)
• CuBAS: Information Geometric Curvature-Based Adaptive Sampling for Supervised Classification [52.452902154360565]
  CuBAS is an information-geometric framework for adaptive data selection in supervised classification.<n>A labeled dataset can be viewed as a statistical manifold, on which local curvature, estimated via the ratio of second to first-order observed Fisher information, faithfully encodes the geometric complexity of the data distribution.
  arXiv  Detail & Related papers  (2026-07-03T09:36:02Z)
• FlatVPR: Plug-and-play Geo-linear Residual Adapter for Geometric Rectification of Foundation Model Feature Manifolds [0.7734726150561086]
  FlatVPR'' bridges the trade-off between map lightweightness and localization accuracy in visual place recognition.<n>Our method explicitly suppresses manifold curvature using a mathematically grounded Pullback Flatness Loss.<n>Experiments on the NCLT dataset demonstrate that the application of our adapter leads to significant performance improvements.
  arXiv  Detail & Related papers  (2026-06-01T05:56:59Z)
• A Mean Curvature Approach to Boundary Detection: Geometric Insights for Unsupervised Learning [52.452902154360565]
  We introduce Mean Curvature Boundary Points (MCBP), a novel geometric framework grounded in Geometric Machine Learning.<n>MCBP explicitly models the intrinsic curvature of the data manifold and computes pointwise mean curvature without requiring principled manifold parametrization.<n>Experiments on synthetic and real-world datasets demonstrate that MCBP consistently improves clustering performance.
  arXiv  Detail & Related papers  (2026-05-05T20:19:09Z)
• Curvature-Aware PCA with Geodesic Tangent Space Aggregation for Semi-Supervised Learning [52.452902154360565]
  GTSA-PCA is a geometric extension of Principal Component Analysis.<n>It integrates curvature awareness and geodesic consistency within a unified spectral framework.<n>Our results position GTSA-PCA as a principled bridge between statistical and geometric approaches to dimensionality reduction.
  arXiv  Detail & Related papers  (2026-04-20T20:36:36Z)
• Neural Local Wasserstein Regression [16.52489456261937]
  We study the estimation problem of distribution-on-distribution regression, where both predictors and responses are probability measures.<n>Existing approaches typically rely on a global optimal transport map or tangent-space linearization.<n>We propose a flexible nonparametric framework that models regression through locally defined transport maps in Wasserstein space.
  arXiv  Detail & Related papers  (2025-11-13T21:54:18Z)
• Hierarchical Spherical CNNs with Lifting-based Adaptive Wavelets for Pooling and Unpooling [101.72318949104627]
  We propose a novel framework of hierarchical convolutional neural networks (HS-CNNs) with a lifting structure to learn adaptive spherical wavelets for pooling and unpooling. LiftHS-CNN ensures a more efficient hierarchical feature learning for both image- and pixel-level tasks.
  arXiv  Detail & Related papers  (2022-05-31T07:23:42Z)
• Rethinking the Zigzag Flattening for Image Reading [48.976491898131265]
  We investigate the Hilbert fractal flattening (HF) as another method for sequence ordering in computer vision. The HF has proven to be superior to other curves in maintaining spatial locality. It can be easily plugged into most deep neural networks (DNNs)
  arXiv  Detail & Related papers  (2022-02-21T13:53:04Z)
• Sign-Agnostic CONet: Learning Implicit Surface Reconstructions by Sign-Agnostic Optimization of Convolutional Occupancy Networks [39.65056638604885]
  We learn implicit surface reconstruction by sign-agnostic optimization of convolutional occupancy networks. We show this goal can be effectively achieved by a simple yet effective design.
  arXiv  Detail & Related papers  (2021-05-08T03:35:32Z)

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.