arXiv (All)
open access
Algorithmic stability via ensembling
Algorithmic stability refers to the property of an algorithm being insensitive to perturbations of the input data, where the type of perturbation may vary depending on the setting. In this work, we develop a general framework to quantify the extent to which any ensembling strategy defined via averag
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
- Distributed Algorithms#3468
- Framework for Loop-Free Convergence Using the Ordered Forwarding Information Base (oFIB) Approach#220707
- On the Convergence, Implicit Bias, and Edge of Stability of Gradient Descent in Deep Learning: Reviewing recent progress [Special Issue on the Mathematics of Deep Learning].#489684
- Numerical Stability of Linear Algebra Operations over Relational Databases#1083300
- Numerical Stability of Linear Algebra Operations over Relational Databases#919522
Record · ID 997311
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