5 citations · 5 across the 3 of their papers we have counts for
4 papers
Constructive Approximation under Carleman's Condition, with Applications to Smoothed Analysis
Frederic Koehler, Beining Wu
A classical result of Carleman, based on the theory of quasianalytic functions, shows that polynomials are dense in for any such that the moments do not…
Overlap Analysis of the Shortest Path Problem: Local Search, Landscapes, and Franz--Parisi Potential
Frederic Koehler, Joonhyung Shin
Two directions in algorithms and complexity involve: (1) classifying which optimization problems can be solved in polynomial time, and (2) understanding which computational problem…
Stein's unbiased risk estimate and Hyvärinen's score matching
Sulagna Ghosh, Nikolaos Ignatiadis, Frederic Koehler +1
Given a collection of observed signals corrupted with Gaussian noise, how can we learn to optimally denoise them? This fundamental problem arises in both empirical Bayes and genera…
Learning Some Popular Gaussian Graphical Models without Condition Number Bounds
Jonathan Kelner, Frederic Koehler, Raghu Meka +1
Gaussian Graphical Models (GGMs) have wide-ranging applications in machine learning and the natural and social sciences. In most of the settings in which they are applied, the numb…