Cover Image

Soft regression trees: a model variant and a decomposition training algorithm

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Consolo, Antonio, Amaldi, Edoardo, Manno, Andrea
Format:	Preprint
Published:	2025
Subjects:	Machine Learning Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Binary Kernel Logistic Regression: a sparsity-inducing formulation and a convergent decomposition training algorithm
by: Consolo, Antonio, et al.
Published: (2025)

Soft decision trees for survival analysis
by: Consolo, Antonio, et al.
Published: (2025)

Efficient algorithms for the Hadamard decomposition
by: Wertz, Samuel, et al.
Published: (2025)

Learning to optimize with guarantees: a complete characterization of linearly convergent algorithms
by: Martin, Andrea, et al.
Published: (2025)

A column generation algorithm with dynamic constraint aggregation for minimum sum-of-squares clustering
by: Sudoso, Antonio M., et al.
Published: (2024)

Unifying back-propagation and forward-forward algorithms through model predictive control
by: Ren, Lianhai, et al.
Published: (2024)

Improved identification of breakpoints in piecewise regression and its applications
by: Kim, Taehyeong, et al.
Published: (2024)

Scaling of hardware-compatible perturbative training algorithms
by: Oripov, Bakhrom G., et al.
Published: (2025)

Towards safe Bayesian optimization with Wiener kernel regression
by: Molodchyk, Oleksii, et al.
Published: (2024)

Group-blind optimal transport to group parity and its constrained variants
by: Zhou, Quan, et al.
Published: (2023)

Dynamic financial processes identification using sparse regressive reservoir computers
by: Vides, Fredy, et al.
Published: (2023)

Compressed and distributed least-squares regression: convergence rates with applications to Federated Learning
by: Philippenko, Constantin, et al.
Published: (2023)

A naive aggregation algorithm for improving generalization in a class of learning problems
by: Befekadu, Getachew K
Published: (2024)

Error dynamics of mini-batch gradient descent with random reshuffling for least squares regression
by: Lok, Jackie, et al.
Published: (2024)

Multiscale replay: A robust algorithm for stochastic variational inequalities with a Markovian buffer
by: Nakul, Milind, et al.
Published: (2026)

Gaussian Process Regression with Soft Inequality and Monotonicity Constraints
by: Kochan, Didem, et al.
Published: (2024)

Path-conditioned training: a principled way to rescale ReLU neural networks
by: Lebeurrier, Arthur, et al.
Published: (2026)

Unboxing Tree Ensembles for interpretability: a hierarchical visualization tool and a multivariate optimal re-built tree
by: Di Teodoro, Giulia, et al.
Published: (2023)

Accelerating nuclear-norm regularized low-rank matrix optimization through Burer-Monteiro decomposition
by: Lee, Ching-pei, et al.
Published: (2022)

Tightening convex relaxations of trained neural networks: a unified approach for convex and S-shaped activations
by: Carrasco, Pablo, et al.
Published: (2024)

Riemannian coordinate descent algorithms on matrix manifolds
by: Han, Andi, et al.
Published: (2024)

Mean-square and linear convergence of a stochastic proximal point algorithm in metric spaces of nonpositive curvature
by: Pischke, Nicholas
Published: (2025)

Derivative-free tree optimization for complex systems
by: Wei, Ye, et al.
Published: (2024)

Primal-dual algorithm for contextual stochastic combinatorial optimization
by: Bouvier, Louis, et al.
Published: (2025)

Variance reduction techniques for stochastic proximal point algorithms
by: Traoré, Cheik, et al.
Published: (2023)

Efficient algorithms for implementing incremental proximal-point methods
by: Shtoff, Alex
Published: (2022)

Wasserstein Barycenter Gaussian Process based Bayesian Optimization
by: Candelieri, Antonio, et al.
Published: (2025)

Guided by the Experts: Provable Feature Learning Dynamic of Soft-Routed Mixture-of-Experts
by: Liao, Fangshuo, et al.
Published: (2025)

Optimal probabilistic feature shifts for reclassification in tree ensembles
by: Blanco, Víctor, et al.
Published: (2024)

Geometric design of the tangent term in landing algorithms for orthogonality constraints
by: Goyens, Florentin, et al.
Published: (2025)

CLASP: An online learning algorithm for Convex Losses And Squared Penalties
by: Ferreira, Ricardo N., et al.
Published: (2026)

Efficient algorithms for regularized Poisson Non-negative Matrix Factorization
by: Perraudin, Nathanaël, et al.
Published: (2024)

Soft Robust MDPs and Risk-Sensitive MDPs: Equivalence, Policy Gradient, and Sample Complexity
by: Zhang, Runyu, et al.
Published: (2023)

A simple and improved algorithm for noisy, convex, zeroth-order optimisation
by: Carpentier, Alexandra
Published: (2024)

Sinkhorn algorithms and linear programming solvers for optimal partial transport problems
by: Bai, Yikun
Published: (2024)

A Unified Framework for Analyzing Meta-algorithms in Online Convex Optimization
by: Pedramfar, Mohammad, et al.
Published: (2024)

The duality structure gradient descent algorithm: analysis and applications to neural networks
by: Flynn, Thomas
Published: (2017)

A randomized algorithm for nonconvex minimization with inexact evaluations and complexity guarantees
by: Li, Shuyao, et al.
Published: (2023)

Randomized algorithms and PAC bounds for inverse reinforcement learning in continuous spaces
by: Kamoutsi, Angeliki, et al.
Published: (2024)

Learning Generative Dynamics with Soft Law Constraints: A McKean-Vlasov FBSDE Approach
by: Boustany, Samer El, et al.
Published: (2026)