Image de couverture de livre

Data organization limits the predictability of binary classification

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Jing, Fei, Zhang, Zi-Ke, Zhang, Yi-Cheng, Zhang, Qingpeng
Format:	Preprint
Publié:	2024
Sujets:	Machine Learning Data Structures and Algorithms Data Analysis, Statistics and Probability
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Scalable network reconstruction in subquadratic time
par: Peixoto, Tiago P.
Publié: (2024)

Perspectives on Stochastic Localization
par: Shi, Bobby, et autres
Publié: (2025)

Efficiently matching random inhomogeneous graphs via degree profiles
par: Ding, Jian, et autres
Publié: (2023)

Zeroth-order Logconcave Sampling
par: Kook, Yunbum, et autres
Publié: (2025)

Online Differentially Private Synthetic Data Generation
par: He, Yiyun, et autres
Publié: (2024)

Analysis of Langevin midpoint methods using an anticipative Girsanov theorem
par: Zhang, Matthew S.
Publié: (2025)

Adversarially-Robust Inference on Trees via Belief Propagation
par: Hopkins, Samuel B., et autres
Publié: (2024)

Learning Mixtures of Gaussians Using Diffusion Models
par: Gatmiry, Khashayar, et autres
Publié: (2024)

Low coordinate degree algorithms I: Universality of computational thresholds for hypothesis testing
par: Kunisky, Dmitriy
Publié: (2024)

A polynomial time iterative algorithm for matching Gaussian matrices with non-vanishing correlation
par: Ding, Jian, et autres
Publié: (2022)

Functional Stochastic Localization
par: Gu, Anming, et autres
Publié: (2026)

High-accuracy log-concave sampling with stochastic queries
par: Chen, Fan, et autres
Publié: (2026)

Complexity of High-Dimensional Identity Testing with Coordinate Conditional Sampling
par: Blanca, Antonio, et autres
Publié: (2022)

Learning bounded-degree polytrees with known skeleton
par: Choo, Davin, et autres
Publié: (2023)

Nonlinear Laplacians: Tunable principal component analysis under directional prior information
par: Ma, Yuxin, et autres
Publié: (2025)

Computational and statistical lower bounds for low-rank estimation under general inhomogeneous noise
par: De, Debsurya, et autres
Publié: (2025)

Correlation detection in trees for planted graph alignment
par: Ganassali, Luca, et autres
Publié: (2021)

Universality of first-order methods on random and deterministic matrices
par: Gorini, Nicola, et autres
Publié: (2026)

Fitting an ellipsoid to a quadratic number of random points
par: Bandeira, Afonso S., et autres
Publié: (2023)

Detection of local geometry in random graphs: information-theoretic and computational limits
par: Bok, Jinho, et autres
Publié: (2026)

Probability Tools for Sequential Random Projection
par: Li, Yingru
Publié: (2024)

Shifted Composition IV: Toward Ballistic Acceleration for Log-Concave Sampling
par: Altschuler, Jason M., et autres
Publié: (2025)

The graph alignment problem: fundamental limits and efficient algorithms
par: Ganassali, Luca
Publié: (2024)

Low coordinate degree algorithms II: Categorical signals and generalized stochastic block models
par: Kunisky, Dmitriy
Publié: (2024)

Differentially Private Low-dimensional Synthetic Data from High-dimensional Datasets
par: He, Yiyun, et autres
Publié: (2023)

Bayesian inference of planted matchings: Local posterior approximation and infinite-volume limit
par: Fan, Zhou, et autres
Publié: (2026)

Optimal Oblivious Subspace Embeddings with Near-optimal Sparsity
par: Chenakkod, Shabarish, et autres
Publié: (2024)

Well-Conditioned Oblivious Perturbations in Linear Space
par: Chenakkod, Shabarish, et autres
Publié: (2026)

Optimal Subspace Embeddings: Resolving Nelson-Nguyen Conjecture Up to Sub-Polylogarithmic Factors
par: Chenakkod, Shabarish, et autres
Publié: (2025)

Singular Subspace Perturbation Bounds via Rectangular Random Matrix Diffusions
par: Lai, Peiyao, et autres
Publié: (2024)

Improved sampling algorithms and functional inequalities for non-log-concave distributions
par: He, Yuchen, et autres
Publié: (2025)

On Computing Total Variation Distance Between Mixtures of Product Distributions
par: Feng, Weiming, et autres
Publié: (2026)

Algorithmic warm starts for Hamiltonian Monte Carlo
par: Zhang, Matthew S., et autres
Publié: (2026)

Tensor cumulants for statistical inference on invariant distributions
par: Kunisky, Dmitriy, et autres
Publié: (2024)

Statistical Estimation in the Spiked Tensor Model via the Quantum Approximate Optimization Algorithm
par: Zhou, Leo, et autres
Publié: (2024)

On Unbiased Low-Rank Approximation with Minimum Distortion
par: Barnes, Leighton Pate, et autres
Publié: (2025)

Learning from the past: predicting critical transitions with machine learning trained on surrogates of historical data
par: Ma, Zhiqin, et autres
Publié: (2024)

Leaf Stripping on Uniform Attachment Trees
par: Addario-Berry, Louigi, et autres
Publié: (2024)

Simple, unified analysis of Johnson-Lindenstrauss with applications
par: Li, Yingru
Publié: (2024)

Efficiently learning and sampling multimodal distributions with data-based initialization
par: Koehler, Frederic, et autres
Publié: (2024)