Goto

Collaborating Authors

 Overview


428fca9bc1921c25c5121f9da7815cde-Reviews.html

Neural Information Processing Systems

First provide a summary of the paper, and then address the following criteria: Quality, clarity, originality and significance. The set in question in this paper is the set of function with bounded partial derivatives up to order K. The authors' technique mimics the work of Thaler et al (ICALP 2012) only the authors decompose the queries not into regular polynomials (Chebyshev polynomials in the case of Thaler et al), but rather to trigonometric polynomial in this case. The bulk of the work is indeed to show that the abovementioned set of queries can be well-approximated by trigonometric polynomials. Having established that, adding Laplace noise to each monomial suffices to guarantee differential privacy.



2dffbc474aa176b6dc957938c15d0c8b-Reviews.html

Neural Information Processing Systems

First provide a summary of the paper, and then address the following criteria: Quality, clarity, originality and significance. This paper presents a Bayesian approach to state and parameter estimation in nonlinear state-space models, while also learning the transition dynamics through the use of a Gaussian process (GP) prior. The inference mechanism is based on particle Markov chain Monte Carlo (PMCMC) with the recently-introduced idea of ancestor sampling. The paper also discusses computational efficiencies to be had with respect to sparsity and low-rank Cholesky updates. This is a technically sound and strong paper with clear and accessible presentation.


291597a100aadd814d197af4f4bab3a7-Reviews.html

Neural Information Processing Systems

First provide a summary of the paper, and then address the following criteria: Quality, clarity, originality and significance. Online Learning with Costly Features and Labels Summary: The paper discusses a version of sequential prediction where there is a cost associated to obtaining features and labels. First, the case where labels are given but features are bought. Here the regret bound is of the form sqrt{2^d T}. The time dependence is as desired, and a lower bound shows that the exponential dependence in the dimension of the features space cannot be reduced in general.


28fc2782ea7ef51c1104ccf7b9bea13d-Reviews.html

Neural Information Processing Systems

First provide a summary of the paper, and then address the following criteria: Quality, clarity, originality and significance. The paper describes a method for local bandwidth selection in kernel regression models, which ensures adaptivity to local smoothness and dimension. Quality: The paper presents a useful result for adaptivity in kernel regression. The work is set out well. I think that it would be useful to have some more discussion of the bandwidth selection procedure.


285f89b802bcb2651801455c86d78f2a-Reviews.html

Neural Information Processing Systems

First provide a summary of the paper, and then address the following criteria: Quality, clarity, originality and significance. The authors describe a two novel inference methods for the correlated topic model (CTM). They build on analytic results for the conditional logistic normal likelihood to arrive at a fast, easily parallelized exact inference. This leads to an approximate sampling method for producing Polya-Gamma variates. Finally, they propose a method for efficiently drawing samples in the presence of sparsity.


2050e03ca119580f74cca14cc6e97462-Reviews.html

Neural Information Processing Systems

First provide a summary of the paper, and then address the following criteria: Quality, clarity, originality and significance. The authors propose sequential and active formulations for low rank matrix completion including a formulation where the underlying matrix/tensor is known to be noisy. The resultant formulations have strong performance bounds with regard to the number of entries that need to be polled as a function of the matrix rank. Theorem 3 is in my opinion a main contribution and it was good to see it was experimentally verified. The lower bound for uniform sampling given in theorem 4 is also useful, but it appears you did not experimentally verify how close your work is to this lower bound.


1f50893f80d6830d62765ffad7721742-Reviews.html

Neural Information Processing Systems

First provide a summary of the paper, and then address the following criteria: Quality, clarity, originality and significance. Summary: the authors developed a novel method specifically to address an increasingly important problem in neuroscience and cell biology more generally: extract cell bodies from noisy images. The images demonstrate fruitful results, and the quantitative results demonstrate useful performance, although not at the level of a human expert. It would have been nice to see a quantitative comparison between this method and any other previously proposed method. Clarity: i found the paper to be clear.


19bc916108fc6938f52cb96f7e087941-Reviews.html

Neural Information Processing Systems

First provide a summary of the paper, and then address the following criteria: Quality, clarity, originality and significance. The authors study a variant of ratio cut with R clusters where the balancing function is biased towards partitions where each cluster has the same size. The main contribution of the paper is a continuous formulation and an algorithm to optimize the criterion directly, whereas previous algorithms are mostly limited to recursive splitting. The direct solution of multi-cut problems instead of using recursive splitting is an important problem given the new developments in finding balanced graph cuts [3,4,5,11,12,18]. The authors first describe the discrete problem (P) and then derive a relaxation of the problem (P-rlx).


1579779b98ce9edb98dd85606f2c119d-Reviews.html

Neural Information Processing Systems

"NIPS 2013 Neural Information Processing Systems December 5 - 10, Lake Tahoe, Nevada, USA",,, "Paper ID:","1046" "Title:","Convergence of Monte Carlo Tree Search in Simultaneous Move Games" Reviews First provide a summary of the paper, and then address the following criteria: Quality, clarity, originality and significance. This paper studies Monte Carlo tree search in zero-sum extensive form games with perfect information and simultaneous moves. It is proved that the MCTS algorithm converges to an approximate Nash equilibrium under certain conditions. Empirical study confirms the formal result. The detailed comments are as follows. The result is useful and the presentation is clear.