Q4614114 (Q4614114): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The learnability of quantum states / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum speed-up for unsupervised learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neural Network Learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sample size lower bounds in PAC learning by Algorithmic Complexity Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved bounds on quantum learning algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum algorithms for learning and testing juntas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast learning rates in statistical inference through aggregation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal measurements for the dihedral hidden subgroup problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reversing quantum dynamics with near-optimal quantum and classical fidelity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Complexity Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learnability and the Vapnik-Chervonenkis dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning DNF over the Uniform Distribution Using a Quantum Example Oracle / rank
 
Normal rank
Property / cites work
 
Property / cites work: On quantum detection and the square-root measurement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Designing optimal quantum detectors via semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2906787 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved lower bounds for learning from noisy examples: An information-theoretic approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228473 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2810825 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decision theoretic generalizations of the PAC model for neural net and other learning applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: The geometry of quantum learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient membership-query algorithm for learning DNF with respect to the uniform distribution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4808682 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New bounds on classical and quantum one-way communication complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3410550 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cryptographic limitations on learning Boolean formulae and finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toward efficient agnostic learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact lower bounds for the agnostic probably-approximately-correct (PAC) machine learning model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2965510 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the distinguishability of random quantum states / rank
 
Normal rank
Property / cites work
 
Property / cites work: The quantum query complexity of learning multilinear polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of Boolean Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalences and Separations Between Quantum and Classical Learnability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Understanding Machine Learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: General bounds on the number of examples needed for learning probabilistic concepts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharper bounds for Gaussian and empirical processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of the learnable / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4770512 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved lower bound on query complexity for quantum PAC learning / rank
 
Normal rank

Latest revision as of 00:14, 18 July 2024

scientific article; zbMATH DE number 7008327
Language Label Description Also known as
English
No label defined
scientific article; zbMATH DE number 7008327

    Statements

    0 references
    0 references
    30 January 2019
    0 references
    quantum computing
    0 references
    PAC learning
    0 references
    sample complexity
    0 references
    lower bounds
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references