Home Knowledge Base Ridge Regression

Ridge Regression

No mentions found

This entity hasn't been tracked yet, or Iris is still building its knowledge base.

Related Articles from SNS

To Grok Grokking: Provable Grokking in Ridge Regression

arXiv:2601.19791v3 Announce Type: replace Abstract: We study grokking, the onset of generalization long after overfitting, in a classical ridge regression setting. We prove end-to-end grokking results for learning over-parameterized linear regression models using gradient descent with weight decay. Specifically, we prove that the following stages occur: (i) the model overfits the training data early during training; (ii) poor generalization persists long after overfitting has manifested; and...

arXiv CS 9d ago

Improved Scaling Laws via Weak-to-Strong Generalization in Random Feature Ridge Regression

Announce Type: replace Abstract: It is increasingly common in machine learning to use learned models to label data and then employ such data to train more capable models. The phenomenon of weak-to-strong generalization exemplifies the advantage of this two-stage procedure: a strong student is trained on imperfect labels obtained from a weak teacher, and yet the strong student outperforms the weak teacher. In this paper, we show that the potential improvement is substantial, in the sense that...

arXiv CS 7d ago

Reframing preprocessing selection as model-internal calibration in near-infrared spectroscopy: A large-scale benchmark of operator-adaptive PLS and Ridge models

arXiv:2605.13587v3 Announce Type: replace-cross Abstract: Preprocessing screening is often the most expensive part of a near-infrared spectroscopy calibration workflow. It works because smoothing, derivatives, detrending and related filters change the spectral directions seen by partial least squares (PLS) or Ridge regression, but a full external search repeatedly refits nearly the same linear model.

arXiv CS 5d ago

Efficient Benchmarking Is Just Feature Selection and Multiple Regression

Announce Type: replace-cross Abstract: Efficient benchmarking techniques aim to lower the computational cost of evaluating LLMs by predicting full benchmark scores using only a subset of a benchmark's questions. By reframing this problem as an instance of multiple regression with feature selection, we find that existing efficient benchmarking methods can be greatly improved by simply using kernel ridge regression at the prediction stage. Additionally, using an information-theoretic...

arXiv CS 9d ago

Digital Quantum Reservoir Computing for ATM Time Series Prediction

arXiv:2606.04686v1 Announce Type: cross Abstract: We investigate a digital quantum reservoir computing (QRC) framework for multi-step forecasting of automated teller machine (ATM) cash demand time series on near-term quantum devices. The proposed approach uses parametrized four-qubit reservoirs with a fixed structure exploiting partial measurement and reset, where temporal data is encoded in rotation angles. Training is restricted to a classical Ridge-regression readout.

arXiv CS 6d ago

Loop Current Extension as an Effective Delayed Dynamical System

Announce Type: cross Abstract: The Loop Current is the dominant circulation feature of the Gulf of Mexico and exhibits pronounced variability associated with northward extension, retraction, and eddy shedding. Despite decades of study, the extent to which this variability admits a reduced dynamical description remains unclear. We investigate this question using delayed-coordinate representations constructed from satellite-altimetry observations of Loop Current extension.

arXiv Physics 2d ago

FlagGAM: Rule-Based Generalized Additive Modeling for Explainable Tabular Prediction

arXiv:2605.31189v1 Announce Type: new Abstract: Tabular prediction in high-stakes domains requires models that are accurate, transparent, and robust to imperfect inputs. We propose FlagGAM, a rule-defined basis framework that separates feature-level rule construction from prediction. A Flag Core Module converts numerical and categorical variables into sparse, human-readable univariate bases, including threshold flags, category-level flags, tail-deviation bases, and categorical step...

arXiv CS 9d ago

Hybrid Dynamics Modeling for a Flexible 2-DoF Robotic Arm

arXiv:2606.02969v1 Announce Type: new Abstract: This paper examines three approaches for modeling the dynamics of a flexible-link 2-DoF robotic arm to address unmodeled dynamics not captured by rigid-body models. Two physics informed models combine rigid-body dynamics (RBD) formulations with a Gaussian Mixture Model (GMM) to capture residual model errors and linkage flexibility. A kinematics-based regression model serves as a purely data-driven baseline.

arXiv CS 7d ago

GRKV: Global Regression for Training-Free KV Cache Compression in Long-Context LLMs

Announce Type: new Abstract: Large language models (LLMs) with extended context lengths rely on the key-value (KV) cache to support attention over prior tokens. However, maintaining the KV cache incurs substantial memory overhead, motivating KV-cache compression methods that enforce a fixed budget through eviction and merging. Modern eviction methods increasingly adopt span-based retention because preserving contiguous spans is empirically effective and better preserves semantic coherence.

arXiv CS 9d ago

Introducing multiplex semantic networks as multifaceted representations of creative associative knowledge across multilingual samples

arXiv:2606.09403v1 Announce Type: new Abstract: Creativity is a complex cognitive ability that relies on knowledge organisation and retrieval from semantic memory. Yet most research uses a single task to measure it, capturing only a fraction of this complexity. This study investigates multiplex networks - layered semantic networks obtained from six cognitive tasks - as a more comprehensive approach to modelling the associative knowledge underlying creativity.

arXiv CS 1d ago