skip to main content

Explore Research Products in the NSF-PAR

  • Home
  • Search Results
  • Page 1 of 1

Search for: All records

Creators/Authors contains: "Hosseini, Kaave"

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. ; ; ; ( , 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023))
    Etessami, Kousha ; Feige, Uriel ; Puppis, Gabriele (Ed.)
    In a recent article, Alon, Hanneke, Holzman, and Moran (FOCS '21) introduced a unifying framework to study the learnability of classes of partial concepts. One of the central questions studied in their work is whether the learnability of a partial concept class is always inherited from the learnability of some "extension" of it to a total concept class. They showed this is not the case for PAC learning but left the problem open for the stronger notion of online learnability. We resolve this problem by constructing a class of partial concepts that is online learnable, but no extension of it to a class of total concepts is online learnable (or even PAC learnable). 
    more » « less
    Full Text Available 
  2. ; ; ; ; ( , 52nd Annual ACM Symposium on Theory of Computing (STOC))
    Full Text Available 
  3. ; ; ( , 34th Computational Complexity Conference (CCC 2019))
    Accepted Manuscript Full Text Available