arXiv

FFR: Forward-Forward Learning for Regression

Title: FFR: Forward-Forward Learning for Regression

Abstract:

The Forward-Forward (FF) algorithm presents a computationally efficient and biologically plausible alternative to backpropagation (BP), relying on purely local, layer-wise optimization to train neural networks. However, while FF is inherently suited for classification tasks through the use of contrastive positive-negative sample pairs, applying it to regression introduces significant hurdles. Specifically, the continuous nature of target spaces eliminates the natural "opposites" required for contrastive learning, and the conventional goodness function fails to convey information regarding target magnitude or ordering.

To address these limitations, we introduce FFR (Forward-Forward for Regression), which we believe is the first framework to successfully extend FF to practical regression problems, achieving competitive performance across various real-world datasets. FFR incorporates three primary innovations:

  1. Ordinal Competitive Goodness Function: This mechanism substitutes traditional contrastive pairs with competitive learning among partitioned neuron groups, guided by distance-aware ordinal supervision.
  2. Stratified Ladder Architecture: This design enables shallow layers to perform coarse ordinal discrimination while deeper layers refine these outputs into fine-grained regression predictions. It also facilitates multi-scale feature aggregation to enhance collaboration between layers.
  3. Hierarchical Prediction with Uncertainty Estimation: By employing multi-scale predictors, the system delivers robust predictions along with confidence estimates, effectively providing prediction uncertainty as a byproduct.

Extensive experiments demonstrate that FFR recovers an average of 98.6% of the accuracy achieved by BP across five real-world regression benchmarks. Furthermore, it significantly reduces resource consumption, lowering peak training memory usage to just 27% of BP’s requirements at a depth of 8 and 8% at a depth of 32. The per-iteration time is approximately 72% of that required by BP, and the method substantially outperforms all existing competitors that do not rely on backpropagation.


Source: arXiv Generated at: 2026-06-03 00:00:00 UTC

Related Articles

TikTok Billionaire Tops Ambani as Asia’s Second-Richest
Bloomberg

TikTok Billionaire Tops Ambani as Asia’s Second-Richest

TikTok founder surpasses Mukesh Ambani to become Asia’s second-richest person, marking a significant shift in the region...

Publishers in UK can opt out of Google AI search results
BBC News

Publishers in UK can opt out of Google AI search results

UK publishers can now opt out of Google’s AI search summaries, a CMA ruling designed to boost their bargaining power and...

Kioxia Edges Nearer Toyota’s Market Cap in Shakeup to Japan Inc.
Bloomberg

Kioxia Edges Nearer Toyota’s Market Cap in Shakeup to Japan Inc.

Kioxia’s market cap nears Toyota’s, signaling a major shift in Japan’s corporate hierarchy. This narrowing gap highlight...

Reuters

Morning Bid: Marvell, a fitting name for the latest AI darling

Reuters highlights Marvell as a top AI stock, noting its name perfectly suits its status as the newest market darling.

Financial Times

Tim Hayward: I built the Jaguar E-Type of computer keyboards

Tim Hayward compares his bespoke keyboard designs to the Jaguar E-Type. He explores high-end customization for personal ...

Financial Times

AI Labs: Zuckerberg’s $100bn gamble

Meta’s $100 billion AI investment aims to secure AI dominance, but questions remain whether sheer spending can outpace c...