Image de couverture de livre

Sample Complexity of the Sign-Perturbed Sums Identification Method: Scalar Case

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Szentpéteri, Szabolcs, Csáji, Balázs Csanád
Format:	Preprint
Publié:	2024
Sujets:	Machine Learning Systems and Control Statistics Theory
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Finite-Sample Identification of Linear Regression Models with Residual-Permuted Sums
par: Szentpéteri, Szabolcs, et autres
Publié: (2024)

Sample Complexity of the Sign-Perturbed Sums Method
par: Szentpéteri, Szabolcs, et autres
Publié: (2024)

Distribution-Free Confidence Ellipsoids for Ridge Regression with PAC Bounds
par: Szentpéteri, Szabolcs, et autres
Publié: (2026)

Finite Sample Analysis of Distribution-Free Confidence Ellipsoids for Linear Regression
par: Szentpéteri, Szabolcs, et autres
Publié: (2024)

Non-Asymptotic State-Space Identification of Closed-Loop Stochastic Linear Systems using Instrumental Variables
par: Szentpéteri, Szabolcs, et autres
Publié: (2023)

Signed-Perturbed Sums Estimation of ARX Systems: Exact Coverage and Strong Consistency (Extended Version)
par: Carè, Algo, et autres
Publié: (2024)

Improving Kernel-Based Nonasymptotic Simultaneous Confidence Bands
par: Csáji, Balázs Csanád, et autres
Publié: (2024)

Data-Driven Upper Confidence Bounds with Near-Optimal Regret for Heavy-Tailed Bandits
par: Tamás, Ambrus, et autres
Publié: (2024)

Derandomizing Simultaneous Confidence Regions for Band-Limited Functions by Improved Norm Bounds and Majority-Voting Schemes
par: Csáji, Balázs Csanád, et autres
Publié: (2025)

On Rate-Optimal Partitioning Classification from Observable and from Privatised Data
par: Csáji, Balázs Csanád, et autres
Publié: (2023)

Settling the Sample Complexity of Model-Based Offline Reinforcement Learning
par: Li, Gen, et autres
Publié: (2022)

Long-Context Linear System Identification
par: Yüksel, Oğuz Kaan, et autres
Publié: (2024)

Rate-Optimal Non-Asymptotics for the Quadratic Prediction Error Method
par: Stamouli, Charis, et autres
Publié: (2024)

Dual Unscented Kalman Filter Architecture for Sensor Fusion in Water Networks Leak Localization
par: Romero-Ben, Luis, et autres
Publié: (2024)

Joint Learning of Linear Dynamical Systems under Smoothness Constraints
par: Tyagi, Hemant
Publié: (2024)

Function Gradient Approximation with Random Shallow ReLU Networks with Control Applications
par: Lamperski, Andrew, et autres
Publié: (2024)

Kernel Mean Embedding Topology: Weak and Strong Forms for Stochastic Kernels and Implications for Model Learning
par: Saldi, Naci, et autres
Publié: (2025)

Learning linear dynamical systems under convex constraints
par: Tyagi, Hemant, et autres
Publié: (2023)

Minimax-Optimal Reward-Agnostic Exploration in Reinforcement Learning
par: Li, Gen, et autres
Publié: (2023)

On the Sample Complexity of Set Membership Estimation for Linear Systems with Disturbances Bounded by Convex Sets
par: Xu, Haonan, et autres
Publié: (2024)

An Elementary Proof of the Near Optimality of LogSumExp Smoothing
par: Samakhoana, Thabo, et autres
Publié: (2025)

Markov Kernels, Distances and Optimal Control: A Parable of Linear Quadratic Non-Gaussian Distribution Steering
par: Teter, Alexis M. H., et autres
Publié: (2025)

Is Q-Learning Minimax Optimal? A Tight Sample Complexity Analysis
par: Li, Gen, et autres
Publié: (2021)

Probabilistic Guarantees of Stochastic Recursive Gradient in Non-Convex Finite Sum Problems
par: Zhong, Yanjie, et autres
Publié: (2024)

Learning Zero-Sum Linear Quadratic Games with Improved Sample Complexity and Last-Iterate Convergence
par: Wu, Jiduan, et autres
Publié: (2023)

Information-Theoretic Bounds and Task-Centric Learning Complexity for Real-World Dynamic Nonlinear Systems
par: Bulusu, Sri Satish Krishna Chaitanya, et autres
Publié: (2025)

Inference with the Upper Confidence Bound Algorithm
par: Khamaru, Koulik, et autres
Publié: (2024)

Resampled Confidence Regions with Exponential Shrinkage for the Regression Function of Binary Classification
par: Tamás, Ambrus, et autres
Publié: (2023)

Exact Asymptotic Estimation of Unknown Parameters of Perturbed LRE with Application to State Observation
par: Glushchenko, Anton, et autres
Publié: (2023)

Stochastic Optimization with Optimal Importance Sampling
par: Aolaritei, Liviu, et autres
Publié: (2025)

Recursive Estimation of Conditional Kernel Mean Embeddings
par: Tamás, Ambrus, et autres
Publié: (2023)

From Data-Driven to Purpose-Driven Artificial Intelligence: Systems Thinking for Data-Analytic Automation of Patient Care
par: Anadria, Daniel, et autres
Publié: (2025)

Estimating Higher-Order Mixed Memberships via the $\ell_{2,\infty}$ Tensor Perturbation Bound
par: Agterberg, Joshua, et autres
Publié: (2022)

An Improved Analysis of Langevin Algorithms with Prior Diffusion for Non-Log-Concave Sampling
par: Huang, Xunpeng, et autres
Publié: (2024)

Frequentist Regret Analysis of Gaussian Process Thompson Sampling via Fractional Posteriors
par: Roy, Somjit, et autres
Publié: (2026)

Denoising Diffusions with Optimal Transport: Localization, Curvature, and Multi-Scale Complexity
par: Liang, Tengyuan, et autres
Publié: (2024)

The Sample Complexity of Multiple Change Point Identification under Bandit Feedback
par: Graf, Maximilian, et autres
Publié: (2026)

Sampling Decisions
par: Chertkov, Michael, et autres
Publié: (2025)

Way More Than the Sum of Their Parts: From Statistical to Structural Mixtures
par: Crutchfield, James P.
Publié: (2025)

Breaking the Sample Size Barrier in Model-Based Reinforcement Learning with a Generative Model
par: Li, Gen, et autres
Publié: (2020)