Cover Image

Is Transductive Learning Equivalent to PAC Learning?

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Dughmi, Shaddin, Kalayci, Yusuf, York, Grayson
Format:	Preprint
Published:	2024
Subjects:	Machine Learning Data Structures and Algorithms Statistics Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

PAC Learning is just Bipartite Matching (Sort of)
by: Dughmi, Shaddin
Published: (2025)

Near-Optimal Sparsifiers for Stochastic Knapsack and Assignment Problems
by: Dughmi, Shaddin, et al.
Published: (2025)

Limitations of Stochastic Selection with Pairwise Independent Priors
by: Dughmi, Shaddin, et al.
Published: (2023)

Transductive Learning Is Compact
by: Asilis, Julian, et al.
Published: (2024)

Revisiting Agnostic PAC Learning
by: Hanneke, Steve, et al.
Published: (2024)

PAC Learning with Bandit Feedback: Sharp Sample Complexity in the Realizable Setting
by: Hanneke, Steve, et al.
Published: (2026)

Online Learning of Halfspaces with Massart Noise
by: Diakonikolas, Ilias, et al.
Published: (2024)

One-Shot Learning for k-SAT
by: Galanis, Andreas, et al.
Published: (2025)

DDPM Score Matching and Distribution Learning
by: Chewi, Sinho, et al.
Published: (2025)

Sample-Efficient Private Learning of Mixtures of Gaussians
by: Ashtiani, Hassan, et al.
Published: (2024)

Transfer Learning Beyond Bounded Density Ratios
by: Kalavasis, Alkis, et al.
Published: (2024)

Smoothed Analysis of Learning from Positive Samples
by: Lee, Jane H., et al.
Published: (2025)

On Learning Parallel Pancakes with Mostly Uniform Weights
by: Diakonikolas, Ilias, et al.
Published: (2025)

Statistical Query Lower Bounds for Learning Truncated Gaussians
by: Diakonikolas, Ilias, et al.
Published: (2024)

Learning the Sherrington-Kirkpatrick Model Even at Low Temperature
by: Chandrasekaran, Gautam, et al.
Published: (2024)

Learning Confidence Ellipsoids and Applications to Robust Subspace Recovery
by: Gao, Chao, et al.
Published: (2025)

Learning Multinomial Logits in $O(n \log n)$ time
by: Chierichetti, Flavio, et al.
Published: (2026)

Robust Learning of Multi-index Models via Iterative Subspace Approximation
by: Diakonikolas, Ilias, et al.
Published: (2025)

A Near-optimal Algorithm for Learning Margin Halfspaces with Massart Noise
by: Diakonikolas, Ilias, et al.
Published: (2025)

Implicit High-Order Moment Tensor Estimation and Learning Latent Variable Models
by: Diakonikolas, Ilias, et al.
Published: (2024)

Entropy Equivalence Testing
by: Canonne, Clément L., et al.
Published: (2026)

Learning Mixtures of Gaussians Using Diffusion Models
by: Gatmiry, Khashayar, et al.
Published: (2024)

Learning bounded-degree polytrees with known skeleton
by: Choo, Davin, et al.
Published: (2023)

Learning sparse generalized linear models with binary outcomes via iterative hard thresholding
by: Matsumoto, Namiko, et al.
Published: (2025)

Transductive and Learning-Augmented Online Regression
by: Raman, Vinod, et al.
Published: (2025)

Derandomizing Multi-Distribution Learning
by: Larsen, Kasper Green, et al.
Published: (2024)

Rényi-infinity constrained sampling with $d^3$ membership queries
by: Kook, Yunbum, et al.
Published: (2024)

In-and-Out: Algorithmic Diffusion for Sampling Convex Bodies
by: Kook, Yunbum, et al.
Published: (2024)

Sampling and Integration of Logconcave Functions by Algorithmic Diffusion
by: Kook, Yunbum, et al.
Published: (2024)

A Sub-Quadratic Time Algorithm for Robust Sparse Mean Estimation
by: Pensia, Ankit
Published: (2024)

Simple and Nearly-Optimal Sampling for Rank-1 Tensor Completion via Gauss-Jordan
by: Gomez-Leos, Alejandro, et al.
Published: (2024)

Covariance estimation using Markov chain Monte Carlo
by: Kook, Yunbum, et al.
Published: (2024)

SoS Certifiability of Subgaussian Distributions and its Algorithmic Applications
by: Diakonikolas, Ilias, et al.
Published: (2024)

Robust Sparse Estimation for Gaussians with Optimal Error under Huber Contamination
by: Diakonikolas, Ilias, et al.
Published: (2024)

A mixing time bound for Gibbs sampling from log-smooth log-concave distributions
by: Wadia, Neha S.
Published: (2024)

Sample-Efficient Linear Regression with Self-Selection Bias
by: Gaitonde, Jason, et al.
Published: (2024)

Faster Diffusion Sampling with Randomized Midpoints: Sequential and Parallel
by: Gupta, Shivam, et al.
Published: (2024)

Fast parallel sampling under isoperimetry
by: Anari, Nima, et al.
Published: (2024)

On the hardness of learning under symmetries
by: Kiani, Bobak T., et al.
Published: (2024)

SQ Lower Bounds for Non-Gaussian Component Analysis with Weaker Assumptions
by: Diakonikolas, Ilias, et al.
Published: (2024)