arXiv (All)
open access
Ensembles of Exactly Solved Subsamples for Clusterwise Regression: Trimming Without a Trimming Level
Clusterwise least squares partitions regression data into K groups with separate linear fits. We study an ensemble whose base learner is exact: solve the problem to global optimality on each of B random subsamples of size m << n, extend each solution by nearest-surface assignment, align the labels,
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Linear-Query Deterministic Approximation for Non-monotone Submodular Maximization under a Knapsack Constraint#1061314
- Leveraging Large Language Models to Address Data Scarcity in Machine Learning: Applications in Graphene Synthesis#1012002
- Fine-Tuned Machine-Learning Potential for Accurate Description of Mn$_x$O$_y$H$_z$ Clusters on Cobalt Surfaces#206569
- Deconstructing Subset Construction -- Reducing While Determinizing#139164
- Non-Adaptive Learning of Sparse Erdős--Rényi Graphs via Affine Splitting#1118777
Record · ID 1105577
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive