lasso
PulseAugur coverage of lasso — every cluster mentioning lasso across labs, papers, and developer communities, ranked by signal.
- instance of ScienceCast 90%
- instance of mountain ridge 90%
- instance of alphaXiv 70%
- instance of elastic net regularization 70%
- instance of Gotit.pub 70%
- instance of CatalyzeX 70%
- competes with least squares method 60%
- competes with mountain ridge 60%
- used by least squares method 55%
- other ScienceCast 50%
- other alphaXiv 50%
- competes with elastic net regularization 50%
8 day(s) with sentiment data
-
New Siamese Lasso framework enhances feature selection for classification and representation learning
Researchers have introduced a novel framework that integrates Group-Lasso into Siamese networks for feature selection, aiming to identify a concise set of features that preserve data representation and enhance classific…
-
New algorithm optimizes clinical prediction models by factoring in variable costs
Researchers have developed a new algorithm for selecting variables in clinical prediction models that incorporates the costs and harms associated with measuring each variable. This decision-analytic approach, implemente…
-
New Score-Preserving Continual Lasso Method Tackles Catastrophic Forgetting
Researchers have developed a new method called score-preserving continual Lasso (SP-CL) to address catastrophic forgetting in continual learning for high-dimensional sparse linear regression. This approach separates spa…
-
New statistical method improves regression analysis beyond LASSO
Researchers have developed a new statistical method using folded concave penalties (FCP) to improve parameter estimation and variable selection in high-dimensional regression models, particularly when dealing with coint…
-
SelectPFN advances Bayesian variable selection for sparse nonlinear regression
Researchers have developed SelectPFN, a novel Prior-Data Fitted Network (PFN) capable of performing Bayesian variable selection and prediction simultaneously for sparse nonlinear regression. This new model can identify …
-
Guidance-TTT method enhances AI-driven scientific discovery
Researchers have developed a new method called Guidance-TTT to improve open-ended scientific discovery using AI. This approach separates the roles of strategic decision-making and solution implementation, allowing a sma…
-
New CLASSO algorithm for constrained LASSO verified in Lean 4
Researchers have developed CLASSO, a new algorithm for solving the constrained LASSO problem. This method uses a primal path-following approach to efficiently determine coefficient changes and active constraints. The al…
-
Monte Carlo Tree Search enhances financial regression feature selection
Researchers have developed a novel feature selection framework using Monte Carlo Tree Search (MCTS) with Generalized Nested Rollout Policy Adaptation (GNRPA) for high-dimensional financial regression. This method treats…
-
AI systems learn to revise scientific theories and improve discovery processes · 2 sources tracked
Researchers are developing new methods for AI-driven scientific discovery that go beyond optimizing within a fixed set of hypotheses. One approach, "Learning to Outgrow a Theory," enables discovery policies to jointly p…
-
New method enhances covariate selection for causal inference in machine learning
A new research paper introduces a method for improving covariate selection in doubly robust double/debiased machine learning (DML) for causal inference. The proposed approach involves using the union of covariates selec…
-
New PU classification method integrates SMOTE for improved accuracy
Researchers have developed a new logistic regression-based approach for PU classification, specifically addressing violations of the SCAR assumption. This method integrates the SMOTE technique to manage class imbalance …
-
New methods enhance Mixture-of-Experts model efficiency and performance
Researchers have developed new methods to improve the efficiency and performance of Mixture-of-Experts (MoE) models. One approach, Layer-wise Distribution Alignment (LDA), addresses the performance degradation that occu…
-
New Neural Symbolic Regression framework combines deep learning with sparse modeling
Researchers have developed a new Neural Symbolic Regression (NSR) framework that combines neural networks with sparse modeling techniques to discover succinct mathematical expressions from data. This approach first uses…
-
Machine learning models evaluated for elderly hospitalization risk prediction
A new research paper published on arXiv details a comprehensive evaluation of machine learning models for predicting hospitalization risk in elderly patients with multiple long-term conditions. The study developed a sca…
-
New research advances LASSO methods for statistical modeling
Two new research papers explore advancements in the LASSO (Least Absolute Shrinkage and Selection Operator) method for statistical modeling. The first paper details sharp restricted isometry thresholds for rank-restrict…
-
New optimization method shows promise for high-dimensional problems
Researchers have developed a new Bregman Linearized Augmented Lagrangian Method to tackle nonconvex constrained stochastic zeroth-order optimization problems. This method utilizes stochastic zeroth-order gradient estima…
-
Geometry-Constrained KANs Learn Adaptive Edge Functions for Symbolic Regression
Researchers have developed geometry-constrained Kolmogorov-Arnold Networks (KANs) that learn edge geometry through a scalar exponent 'p'. This approach allows for adaptive responses, ranging from sharp, threshold-like b…
-
New MultiSigBERT model enhances oncology survival prediction with multimodal data
Researchers have developed MultiSigBERT, a novel framework for multimodal sequential survival modeling in oncology. This approach integrates heterogeneous data sources, including narrative clinical reports and structure…
-
New SAR despeckling method achieves top performance in benchmarks
Researchers have developed a novel method for synthetic aperture radar (SAR) despeckling, a process that removes noise from SAR images without obscuring important scattering structures. The new technique revisits a nonl…
-
New theoretical bounds improve Langevin sampling for complex distributions
Researchers have developed new theoretical bounds for the Moreau--Yosida unadjusted Langevin algorithm (MYULA), a method used for sampling from complex probability distributions. The study focuses on nonsmooth composite…