vix.ing · top · new · best · stats · spec

Vondrak, Jan

  1. Lazier Than Lazy Greedy
    2014/09/28 by Mirzasoleiman, Baharan, Badanidiyuru, Ashwinkumar, Karbasi, Amin +2 · 10 citations
    #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Information Retrieval (cs.IR) #Machine Learning (cs.LG)
  2. High probability generalization bounds for uniformly stable algorithms\n with nearly optimal rate
    2019/02/27 by Vitaly Feldman, Feldman, Vitaly, J. Vondrák +1 · 10 citations
    Computer Science · #Numerical Methods and Algorithms #Neural Networks and Applications #Error Correcting Code Techniques
  3. Generalization Bounds for Uniformly Stable Algorithms
    2018/12/24 by Vitaly Feldman, Feldman, Vitaly, J. Vondrák +1 · 11 citations
    Engineering · Computer Science · #Sparse and Compressive Sensing Techniques #Machine Learning and Algorithms #Stochastic Gradient Optimization Techniques
  4. A note on concentration of submodular functions
    2010/05/17 by Vondrak, Jan · 2 citations
    #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences
  5. The Computational Complexity of Truthfulness in Combinatorial Auctions
    2012/02/13 by Dobzinski, Shahar, Vondrak, Jan · 2 citations
    #Computer Science and Game Theory (cs.GT) #FOS: Computer and information sciences
  6. Online submodular welfare maximization: Greedy is optimal
    2012/04/04 by Kapralov, Michael, Post, Ian, Vondrak, Jan · 2 citations
    #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
  7. Representation, Approximation and Learning of Submodular Functions Using Low-rank Decision Trees
    2013/04/02 by Feldman, Vitaly, Kothari, Pravesh, Vondrak, Jan · 2 citations
    #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Machine Learning (cs.LG)
  8. Optimal Bounds on Approximation of Submodular and XOS Functions by Juntas
    2013/07/12 by Vitaly Feldman, Feldman, Vitaly, Jan Vondrák +1 · 2 citations
    Computer Science · #Complexity and Algorithms in Graphs #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Imbalanced Data Classification Techniques #Machine Learning (cs.LG) #Machine Learning and Algorithms
  9. Tight Bounds on Low-degree Spectral Concentration of Submodular and XOS functions
    2015/04/13 by Feldman, Vitaly, Vondrak, Jan · 2 citations
    #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Machine Learning (cs.LG)
  10. Limitations of randomized mechanisms for combinatorial auctions
    2011/09/06 by Shaddin Dughmi, Dughmi, Shaddin, Jan Vondrák +1 · 3 citations
    Computer Science · Decision Sciences · Economics, Econometrics and Finance · #Auction Theory and Applications #Computer Science and Game Theory (cs.GT) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Game Theory and Voting Systems #Optimization and Search Problems
  11. A polynomial lower bound on adaptive complexity of submodular maximization
    2020/02/21 by Li, Wenzheng, Liu, Paul, Vondrak, Jan · 2 citations
    #Data Structures and Algorithms (cs.DS) #Distributed #FOS: Computer and information sciences #Parallel #and Cluster Computing (cs.DC)
  12. Is submodularity testable?
    2010/08/04 by C. Seshadhri, Seshadhri, C., Jan Vondrák +1 · 2 citations
    Computer Science · #Complexity and Algorithms in Graphs #Advanced Graph Theory Research #semigroups and automata theory
  13. Dependent Randomized Rounding for Matroid Polytopes and Applications
    2009/09/24 by Chandra Chekuri, Chekuri, Chandra, J. Vondrák +3 · 1 citation
    Computer Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Computational Geometry and Mesh Generation #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences
  14. A constant factor approximation for Nash social welfare with subadditive valuations
    2023/09/09 by Shahar Dobzinski, Dobzinski, Shahar, Wenzheng Li +5 · 1 citation
    Engineering · #Transportation and Mobility Innovations
  15. Cardinality constrained submodular maximization for random streams
    2021/11/14 by Liu, Paul, Rubinstein, Aviad, Vondrak, Jan +1 · 1 citation
    #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences