skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


  • Home
  • Search Results
  • Page 1 of 1

Search for: All records

Creators/Authors contains: "Zakynthinou, Lydia"

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. ; ; (, International Conference on Machine Learning)
  2. ; ; ; (, Conference on Learning Theory)
  3. ; ; ; ; (, Advances in Neural Information Processing Systems 34 (NeurIPS 2021))
    Accepted Manuscript Full Text Available
  4. ; ; (, Proceedings of the AAAI Conference on Artificial Intelligence)
    We study the problem of differentially private constrained maximization of decomposable submodular functions. A submodular function is decomposable if it takes the form of a sum of submodular functions. The special case of maximizing a monotone, decomposable submodular function under cardinality constraints is known as the Combinatorial Public Projects (CPP) problem (Papadimitriou, Schapira, and Singer 2008). Previous work by Gupta et al. (2010) gave a differentially private algorithm for the CPP problem. We extend this work by designing differentially private algorithms for both monotone and non-monotone decomposable submodular maximization under general matroid constraints, with competitive utility guarantees. We complement our theoretical bounds with experiments demonstrating improved empirical performance. 
    more » « less
    Accepted Manuscript Full Text Available
  5. ; ; ; ; (, Advances in neural information processing systems)
    Accepted Manuscript Full Text Available
  6. ; ; ; ; (, Advances in neural information processing systems)
    Accepted Manuscript Full Text Available
  7. ; ; (, Proceedings of Machine Learning Research)
    Accepted Manuscript Full Text Available
  8. ; ; ; ; (, Advances in Neural Information Processing Systems)
    null (Ed.)
    Accepted Manuscript Full Text Available