Cover Image

Finite Sample Complexity Analysis of Binary Segmentation

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Hocking, Toby Dylan
Format:	Preprint
Published:	2024
Subjects:	Machine Learning Computation
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Efficient line search for optimizing Area Under the ROC Curve in gradient descent
by: Fowler, Jadon, et al.
Published: (2024)

Penalty Learning for Optimal Partitioning using Multilayer Perceptron
by: Nguyen, Tung L, et al.
Published: (2024)

Interval Regression: A Comparative Study with Proposed Models
by: Nguyen, Tung L, et al.
Published: (2025)

Understanding When Poisson Log-Normal Models Outperform Penalized Poisson Regression for Microbiome Count Data
by: Agyapong, Daniel, et al.
Published: (2026)

Learning Penalty for Optimal Partitioning via Automatic Feature Extraction
by: Nguyen, Tung L, et al.
Published: (2025)

Visualisation interactive de données dans R avec animint2
by: Hocking, Toby Dylan
Published: (2026)

Finite-Sample Analysis of Nonlinear Independent Component Analysis:Sample Complexity and Identifiability Bounds
by: Jiang, Yuwen
Published: (2026)

Fused Lasso Improves Accuracy of Co-occurrence Network Inference in Grouped Samples
by: Agyapong, Daniel, et al.
Published: (2025)

SOAK: Same/Other/All K-fold cross-validation for estimating similarity of patterns in data subsets
by: Hocking, Toby Dylan, et al.
Published: (2024)

Finite Sample Bounds for Non-Parametric Regression: Optimal Sample Efficiency and Space Complexity
by: Maran, Davide, et al.
Published: (2024)

Entropy Adaptive Decoding: Dynamic Model Switching for Efficient Inference
by: Simonds, Toby
Published: (2025)

Finite Time Analysis of Constrained Natural Critic-Actor Algorithm with Improved Sample Complexity
by: Panda, Prashansa, et al.
Published: (2025)

The Sample Complexity of Simple Binary Hypothesis Testing
by: Pensia, Ankit, et al.
Published: (2024)

On the Sample Complexity of Robust Binary Hypothesis Testing
by: Vallinayagam, Shankar, et al.
Published: (2026)

A Finite Sample Complexity Bound for Distributionally Robust Q-learning
by: Wang, Shengbo, et al.
Published: (2023)

LLM Tree Search
by: Wilson, Dylan
Published: (2024)

Block-Wise Differentiable Sinkhorn Attention: Tail-Refinement Gradients with a Gap-Aware Dustbin Bridge
by: Forde, Dylan
Published: (2026)

Complexity Analysis of Normalizing Constant Estimation: from Jarzynski Equality to Annealed Importance Sampling and beyond
by: Guo, Wei, et al.
Published: (2025)

Evaluating Binary Decision Biases in Large Language Models: Implications for Fair Agent-Based Financial Simulations
by: Vidler, Alicia, et al.
Published: (2025)

Finite-Sample Analysis of Elimination in Active Hypothesis Testing
by: Lin, Ziyuan, et al.
Published: (2026)

RAPiD-Seg: Range-Aware Pointwise Distance Distribution Networks for 3D LiDAR Segmentation
by: Li, Li, et al.
Published: (2024)

Enhancing Binary Encoded Crime Linkage Analysis Using Siamese Network
by: Zhan, Yicheng, et al.
Published: (2025)

Application of Quantum Pre-Processing Filter for Binary Image Classification with Small Samples
by: Riaz, Farina, et al.
Published: (2023)

Lipschitz-Based Robustness Certification Under Floating-Point Execution
by: Murray, Toby
Published: (2026)

Finite-Time Convergence and Sample Complexity of Actor-Critic Multi-Objective Reinforcement Learning
by: Zhou, Tianchen, et al.
Published: (2024)

Zeros can be Informative: Masked Binary U-Net for Image Segmentation on Tensor Cores
by: Wu, Chunshu, et al.
Published: (2026)

TOMD: A Trail-based Off-road Multimodal Dataset for Traversable Pathway Segmentation under Challenging Illumination Conditions
by: Sun, Yixin, et al.
Published: (2025)

The Role of Recurrency in Image Segmentation for Noisy and Limited Sample Settings
by: Calhas, David, et al.
Published: (2024)

Is Escalation Worth It? A Decision-Theoretic Characterization of LLM Cascades
by: Bouchard, Dylan
Published: (2026)

Sample Complexity Bounds for Linear System Identification from a Finite Set
by: Chatzikiriakos, Nicolas, et al.
Published: (2024)

Exploratory Preference Optimization: Harnessing Implicit Q*-Approximation for Sample-Efficient RLHF
by: Xie, Tengyang, et al.
Published: (2024)

Universality of Linear Recurrences Followed by Non-linear Projections: Finite-Width Guarantees and Benefits of Complex Eigenvalues
by: Orvieto, Antonio, et al.
Published: (2023)

BiSeg-SAM: Weakly-Supervised Post-Processing Framework for Boosting Binary Segmentation in Segment Anything Models
by: Su, Encheng, et al.
Published: (2025)

The Sample Complexity of Replicable Realizable PAC Learning
by: Larsen, Kasper Green, et al.
Published: (2026)

Finite-Sample Analysis of the Monte Carlo Exploring Starts Algorithm for Reinforcement Learning
by: Chen, Suei-Wen, et al.
Published: (2024)

Finite-Sample Analysis of Policy Evaluation for Robust Average Reward Reinforcement Learning
by: Xu, Yang, et al.
Published: (2025)

A Finite Sample Analysis of Distributional TD Learning with Linear Function Approximation
by: Peng, Yang, et al.
Published: (2025)

A Finite Time Analysis of Thompson Sampling for Bayesian Optimization with Preferential Feedback
by: Lazzaro, Joseph, et al.
Published: (2026)

The Risks of Recourse in Binary Classification
by: Fokkema, Hidde, et al.
Published: (2023)

Necessary and Sufficient Oracles: Toward a Computational Taxonomy For Reinforcement Learning
by: Rohatgi, Dhruv, et al.
Published: (2025)