Image de couverture de livre

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

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Consolo, Antonio, Amaldi, Edoardo, Manno, Andrea
Format:	Preprint
Publié:	2025
Sujets:	Machine Learning Optimization and Control
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Binary Kernel Logistic Regression: a sparsity-inducing formulation and a convergent decomposition training algorithm
par: Consolo, Antonio, et autres
Publié: (2025)

Soft decision trees for survival analysis
par: Consolo, Antonio, et autres
Publié: (2025)

Efficient algorithms for the Hadamard decomposition
par: Wertz, Samuel, et autres
Publié: (2025)

Learning to optimize with guarantees: a complete characterization of linearly convergent algorithms
par: Martin, Andrea, et autres
Publié: (2025)

A column generation algorithm with dynamic constraint aggregation for minimum sum-of-squares clustering
par: Sudoso, Antonio M., et autres
Publié: (2024)

Unifying back-propagation and forward-forward algorithms through model predictive control
par: Ren, Lianhai, et autres
Publié: (2024)

Improved identification of breakpoints in piecewise regression and its applications
par: Kim, Taehyeong, et autres
Publié: (2024)

Scaling of hardware-compatible perturbative training algorithms
par: Oripov, Bakhrom G., et autres
Publié: (2025)

Towards safe Bayesian optimization with Wiener kernel regression
par: Molodchyk, Oleksii, et autres
Publié: (2024)

Group-blind optimal transport to group parity and its constrained variants
par: Zhou, Quan, et autres
Publié: (2023)

Dynamic financial processes identification using sparse regressive reservoir computers
par: Vides, Fredy, et autres
Publié: (2023)

Compressed and distributed least-squares regression: convergence rates with applications to Federated Learning
par: Philippenko, Constantin, et autres
Publié: (2023)

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

Error dynamics of mini-batch gradient descent with random reshuffling for least squares regression
par: Lok, Jackie, et autres
Publié: (2024)

Multiscale replay: A robust algorithm for stochastic variational inequalities with a Markovian buffer
par: Nakul, Milind, et autres
Publié: (2026)

Gaussian Process Regression with Soft Inequality and Monotonicity Constraints
par: Kochan, Didem, et autres
Publié: (2024)

Path-conditioned training: a principled way to rescale ReLU neural networks
par: Lebeurrier, Arthur, et autres
Publié: (2026)

Unboxing Tree Ensembles for interpretability: a hierarchical visualization tool and a multivariate optimal re-built tree
par: Di Teodoro, Giulia, et autres
Publié: (2023)

Accelerating nuclear-norm regularized low-rank matrix optimization through Burer-Monteiro decomposition
par: Lee, Ching-pei, et autres
Publié: (2022)

Tightening convex relaxations of trained neural networks: a unified approach for convex and S-shaped activations
par: Carrasco, Pablo, et autres
Publié: (2024)

Riemannian coordinate descent algorithms on matrix manifolds
par: Han, Andi, et autres
Publié: (2024)

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

Derivative-free tree optimization for complex systems
par: Wei, Ye, et autres
Publié: (2024)

Primal-dual algorithm for contextual stochastic combinatorial optimization
par: Bouvier, Louis, et autres
Publié: (2025)

Variance reduction techniques for stochastic proximal point algorithms
par: Traoré, Cheik, et autres
Publié: (2023)

Efficient algorithms for implementing incremental proximal-point methods
par: Shtoff, Alex
Publié: (2022)

Wasserstein Barycenter Gaussian Process based Bayesian Optimization
par: Candelieri, Antonio, et autres
Publié: (2025)

Guided by the Experts: Provable Feature Learning Dynamic of Soft-Routed Mixture-of-Experts
par: Liao, Fangshuo, et autres
Publié: (2025)

Optimal probabilistic feature shifts for reclassification in tree ensembles
par: Blanco, Víctor, et autres
Publié: (2024)

Geometric design of the tangent term in landing algorithms for orthogonality constraints
par: Goyens, Florentin, et autres
Publié: (2025)

CLASP: An online learning algorithm for Convex Losses And Squared Penalties
par: Ferreira, Ricardo N., et autres
Publié: (2026)

Efficient algorithms for regularized Poisson Non-negative Matrix Factorization
par: Perraudin, Nathanaël, et autres
Publié: (2024)

Soft Robust MDPs and Risk-Sensitive MDPs: Equivalence, Policy Gradient, and Sample Complexity
par: Zhang, Runyu, et autres
Publié: (2023)

A simple and improved algorithm for noisy, convex, zeroth-order optimisation
par: Carpentier, Alexandra
Publié: (2024)

Sinkhorn algorithms and linear programming solvers for optimal partial transport problems
par: Bai, Yikun
Publié: (2024)

A Unified Framework for Analyzing Meta-algorithms in Online Convex Optimization
par: Pedramfar, Mohammad, et autres
Publié: (2024)

The duality structure gradient descent algorithm: analysis and applications to neural networks
par: Flynn, Thomas
Publié: (2017)

A randomized algorithm for nonconvex minimization with inexact evaluations and complexity guarantees
par: Li, Shuyao, et autres
Publié: (2023)

Randomized algorithms and PAC bounds for inverse reinforcement learning in continuous spaces
par: Kamoutsi, Angeliki, et autres
Publié: (2024)

Learning Generative Dynamics with Soft Law Constraints: A McKean-Vlasov FBSDE Approach
par: Boustany, Samer El, et autres
Publié: (2026)