Search Results for author:
Found 8 papers, 0 papers with code
Learnability is a Compact Property
Furthermore, the learnability of such problems can fail to be a property of finite character: informally, it cannot be detected by examining finite projections of the problem.
Regularization and Optimal Multiclass Learning
We demonstrate that an agnostic version of the Hall complexity again characterizes error rates exactly, and exhibit an optimal learner using maximum entropy programs.
Quantum Combinatorial Games: Structures and Computational Complexity
The beauty of quantum games-succinct in representation, rich in structures, explosive in complexity, dazzling for visualization, and sophisticated for strategic reasoning-has drawn us to play concrete games full of subtleties and to characterize abstract properties pertinent to complexity consequence.
Network Essence: PageRank Completion and Centrality-Conforming Markov Chains
In the age of social and information networks, I will then turn the discussion from geometric structures to network structures, attempting to take a humble step towards the holy grail of network science, that is to understand the network essence that underlies the observed sparse-and-multifaceted network data.
Spectral Sparsification of Random-Walk Matrix Polynomials
Our work is particularly motivated by the algorithmic problems for speeding up the classic Newton's method in applications such as computing the inverse square-root of the precision matrix of a Gaussian random field, as well as computing the $q$th-root transition (for $q\geq1$) in a time-reversible Markov model.
Scalable Parallel Factorizations of SDD Matrices and Efficient Sampling for Gaussian Graphical Models
random samples for $n$-dimensional Gaussian random fields with SDDM precision matrices.
Efficient Clustering with Limited Distance Information
Given a point set S and an unknown metric d on S, we study the problem of efficiently partitioning S into k clusters while querying few distances between the points.
Smoothed Analysis of Algorithms: Why the Simplex Algorithm Usually Takes Polynomial Time
We measure this performance in terms of both the input size and the magnitude of the perturbations.
Data Structures and Algorithms G.1.6
