eScholarship
metadata only
Surrogate-Based Autotuning for Randomized Sketching Algorithms in Regression Problems
Algorithms from Randomized Numerical Linear Algebra (RandNLA) are known to be effective in handling high-dimensional computational problems, providing high-quality empirical performance as well as strong probabilistic guarantees. However, their practical application is complicated by the f
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
- Sampled-Max Subgradient Method for Convex Finite-Max Optimization#1117585
- Solving Hypergraph Laplacian Systems in Almost-Linear Time#1156341
- VAC: A Volume-sampling-based Elimination Rule for Approximate Cholesky Factorization#1034009
- RTSMS: Randomized Tucker with single-mode sketching#999620
- Online Convex Optimization with Sublinear Noisy Probes#271829
Record · ID 983431
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