Cover Image

Estimating Coverage in Streams via a Modified CVM Method

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Hernandez-Suarez, Carlos
Format:	Preprint
Published:	2025
Subjects:	Computation Machine Learning 68W20
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Random feature-based double Vovk-Azoury-Warmuth algorithm for online multi-kernel learning
by: Rokhlin, Dmitry B., et al.
Published: (2025)

A hierarchical Vovk-Azoury-Warmuth forecaster with discounting for online regression in RKHS
by: Rokhlin, Dmitry B.
Published: (2025)

Robust Tensor CUR Decompositions: Rapid Low-Tucker-Rank Tensor Recovery with Sparse Corruption
by: Cai, HanQin, et al.
Published: (2023)

Oblivious subspace embeddings for compressed Tucker decompositions
by: Pietrosanu, Matthew, et al.
Published: (2024)

Theoretical Compression Bounds for Wide Multilayer Perceptrons
by: Cheairi, Houssam El, et al.
Published: (2025)

Towards a Rigorous Understanding of the Population Dynamics of the NSGA-III: Tight Runtime Bounds
by: Opris, Andre
Published: (2025)

Evolutionary Computation as Natural Generative AI
by: Shi, Yaxin, et al.
Published: (2025)

Sub-Token Routing in LoRA for Adaptation and Query-Aware KV Compression
by: Jiang, Wei, et al.
Published: (2026)

Random-Order Online Independent Set of Intervals and Hyperrectangles
by: Garg, Mohit, et al.
Published: (2024)

Balanced Group Convolution: An Improved Group Convolution Based on Approximability Estimates
by: Lee, Youngkyu, et al.
Published: (2023)

Population Protocols Revisited: Parity and Beyond
by: Gąsieniec, Leszek, et al.
Published: (2025)

TNStream: Applying Tightest Neighbors to Micro-Clusters to Define Multi-Density Clusters in Streaming Data
by: Zeng, Qifen, et al.
Published: (2025)

Shortest Paths without a Map, but with an Entropic Regularizer
by: Bubeck, Sébastien, et al.
Published: (2022)

Runtime Analyses of NSGA-III on Many-Objective Problems: Provable Exponential Speedup via Stochastic Population Update
by: Opris, Andre
Published: (2025)

CompressedScaffnew: The First Theoretical Double Acceleration of Communication from Local Training and Compression in Distributed Optimization
by: Condat, Laurent, et al.
Published: (2022)

Optimizing Genetic Algorithms Using the Binomial Distribution
by: Cicirello, Vincent A.
Published: (2024)

Surrogate-based Autotuning for Randomized Sketching Algorithms in Regression Problems
by: Cho, Younghyun, et al.
Published: (2023)

Randomized batch-sampling Kaczmarz methods for solving linear systems
by: Xie, Dong-Yue, et al.
Published: (2025)

Parameter Tuning of the Firefly Algorithm by Standard Monte Carlo and Quasi-Monte Carlo Methods
by: Joy, Geethu, et al.
Published: (2024)

Randomized Matrix Sketching for Neural Network Training and Gradient Monitoring
by: Antil, Harbir, et al.
Published: (2025)

Convergence of Momentum-Based Optimization Algorithms with Time-Varying Parameters
by: Vidyasagar, Mathukumalli
Published: (2025)

On Identifying Critical Network Edges via Analyzing Changes in Shapes (Curvatures)
by: DasGupta, Bhaskar, et al.
Published: (2026)

Analysis of an Idealized Stochastic Polyak Method and its Application to Black-Box Model Distillation
by: Gower, Robert M., et al.
Published: (2025)

Tight Runtime Guarantees From Understanding the Population Dynamics of the GSEMO Multi-Objective Evolutionary Algorithm
by: Doerr, Benjamin, et al.
Published: (2025)

Ballistic Convergence in Hit-and-Run Monte Carlo and a Coordinate-free Randomized Kaczmarz Algorithm
by: Bou-Rabee, Nawaf, et al.
Published: (2024)

Open Source Evolutionary Computation with Chips-n-Salsa
by: Cicirello, Vincent A.
Published: (2024)

A First Runtime Analysis of the PAES-25: An Enhanced Variant of the Pareto Archived Evolution Strategy
by: Opris, Andre
Published: (2025)

Runtime Analyses of NSGA-III on Many-Objective Problems
by: Opris, Andre, et al.
Published: (2024)

Achieving Tight $O(4^k)$ Runtime Bounds on Jump$_k$ by Proving that Genetic Algorithms Evolve Near-Maximal Population Diversity
by: Opris, Andre, et al.
Published: (2024)

Stochastic trace estimation for parameter-dependent matrices applied to spectral density approximation
by: Matti, Fabio, et al.
Published: (2025)

Sequential Least-Squares Estimators with Fast Randomized Sketching for Linear Statistical Models
by: Chen, Guan-Yu, et al.
Published: (2025)

Adaptive randomized pivoting and volume sampling
by: Epperly, Ethan N.
Published: (2025)

Optimal Bound for PCA with Outliers using Higher-Degree Voronoi Diagrams
by: Hashemian, Sajjad, et al.
Published: (2024)

On sampling two spin models using the local connective constant
by: Efthymiou, Charilaos
Published: (2024)

Strongly Sublinear Algorithms for Testing Pattern Freeness
by: Newman, Ilan, et al.
Published: (2021)

Algebraic Algorithms for Fractional Linear Matroid Parity via Non-commutative Rank
by: Oki, Taihei, et al.
Published: (2022)

Incremental-Decremental Maximization
by: Disser, Yann, et al.
Published: (2025)

Stealth edits to large language models
by: Sutton, Oliver J., et al.
Published: (2024)

Evo* 2023 -- Late-Breaking Abstracts Volume
by: Mora, A. M., et al.
Published: (2024)

Domain-Informed Genetic Superposition Programming: A Case Study on SFRC Beams
by: Khorshidi, Mohammad Sadegh, et al.
Published: (2025)