Pages that link to "Item:Q1342730"
From MaRDI portal
The following pages link to Toward efficient agnostic learning (Q1342730):
Displaying 50 items.
- Learning conjunctions with noise under product distributions (Q293443) (← links)
- Oracle inequalities for the Lasso in the high-dimensional Aalen multiplicative intensity model (Q297474) (← links)
- Exploiting label dependencies for improved sample complexity (Q374170) (← links)
- Knows what it knows: a framework for self-aware learning (Q413843) (← links)
- A complete characterization of statistical query learning with applications to evolvability (Q439989) (← links)
- Reliable agnostic learning (Q439993) (← links)
- A new column generation algorithm for logical analysis of data (Q646710) (← links)
- Maximizing agreements and coagnostic learning (Q817828) (← links)
- Self-improved gaps almost everywhere for the agnostic approximation of monomials (Q884469) (← links)
- Voting rules as error-correcting codes (Q899434) (← links)
- PEBBL: an object-oriented framework for scalable parallel branch and bound (Q903924) (← links)
- A note on the inapproximability of correlation clustering (Q975483) (← links)
- Prediction, learning, uniform convergence, and scale-sensitive dimensions (Q1271550) (← links)
- Learning with restricted focus of attention (Q1271613) (← links)
- Learning with queries corrupted by classification noise (Q1304475) (← links)
- Efficient distribution-free learning of probabilistic concepts (Q1329154) (← links)
- Rationality and intelligence (Q1391347) (← links)
- On the difficulty of approximately maximizing agreements. (Q1401958) (← links)
- Bayesian model averaging: A tutorial. (with comments and a rejoinder). (Q1431179) (← links)
- Proofs of Work from worst-case assumptions (Q1673424) (← links)
- Hierarchical design of fast minimum disagreement algorithms (Q1704562) (← links)
- Learning local transductions is hard (Q1770836) (← links)
- PAC learning with nasty noise. (Q1853516) (← links)
- On the complexity of learning for spiking neurons with temporal coding. (Q1854302) (← links)
- Some connections between learning and optimization (Q1885804) (← links)
- Efficient algorithms for learning functions with bounded variation (Q1887165) (← links)
- On the complexity of function learning (Q1900975) (← links)
- Polynomial regression under arbitrary product distributions (Q1959600) (← links)
- Surrogate losses in passive and active learning (Q2008623) (← links)
- A literature review on correlation clustering: cross-disciplinary taxonomy with bibliometric analysis (Q2079285) (← links)
- On the robustness of randomized classifiers to adversarial examples (Q2102396) (← links)
- On biased random walks, corrupted intervals, and learning under adversarial design (Q2202524) (← links)
- Towards a proof of the Fourier-entropy conjecture? (Q2216459) (← links)
- PAC-learning in the presence of one-sided classification~noise (Q2254605) (← links)
- Tight bounds on \(\ell_1\) approximation and learning of self-bounding functions (Q2290687) (← links)
- Exact lower bounds for the agnostic probably-approximately-correct (PAC) machine learning model (Q2328061) (← links)
- Sparsistency and agnostic inference in sparse PCA (Q2338928) (← links)
- \(L_{p}\)-norm Sauer-Shelah lemma for margin multi-category classifiers (Q2402375) (← links)
- Supervised box clustering (Q2418297) (← links)
- Rates of convergence in active learning (Q2429933) (← links)
- Tolerant property testing and distance approximation (Q2507697) (← links)
- Clustering with qualitative information (Q2568462) (← links)
- An Improved Branch-and-Bound Method for Maximum Monomial Agreement (Q2815448) (← links)
- Optimal Bounds on Approximation of Submodular and XOS Functions by Juntas (Q2816303) (← links)
- Learning Hurdles for Sleeping Experts (Q2828218) (← links)
- Hierarchical Design of Fast Minimum Disagreement Algorithms (Q2835623) (← links)
- Learning $$AC^0$$ Under k-Dependent Distributions (Q2988821) (← links)
- Nearly Optimal Solutions for the Chow Parameters Problem and Low-Weight Approximation of Halfspaces (Q3189646) (← links)
- Sample Complexity Bounds on Differentially Private Learning via Communication Complexity (Q3454521) (← links)
- Agnostic Clustering (Q3648765) (← links)
