Search Results for author:
Found 12 papers, 3 papers with code
Unrolled denoising networks provably learn optimal Bayesian inference
In recent years, algorithm unrolling has emerged as deep learning's answer to this age-old question: design a neural network whose layers can in principle simulate iterations of inference algorithms and train on data generated by the unknown prior.
Causal Language Modeling Can Elicit Search and Reasoning Capabilities on Logic Puzzles
We observe that Transformer models trained on this synthetic task can indeed learn to solve Sudokus (our model solves $94. 21\%$ of the puzzles fully correctly) when trained on a logical sequence of steps taken by a solver.
Learning general Gaussian mixtures with efficient score matching
Prior works for this problem either (i) required exponential runtime in the dimension $d$, (ii) placed strong assumptions on the instance (e. g., spherical covariances or clusterability), or (iii) had doubly exponential dependence on the number of components $k$.
Simple Mechanisms for Representing, Indexing and Manipulating Concepts
Deep networks typically learn concepts via classifiers, which involves setting up a model and training it via gradient descent to fit the concept-labeled data.
Ambient Diffusion: Learning Clean Distributions from Corrupted Data
We present the first diffusion-based framework that can learn an unknown distribution using only highly-corrupted samples.
RISAN: Robust Instance Specific Abstention Network
In this paper, we propose deep architectures for learning instance specific abstain (reject option) binary classifiers.
Learning and Generalization in Overparameterized Normalizing Flows
In supervised learning, it is known that overparameterized neural networks with one hidden layer provably and efficiently learn and generalize, when trained using stochastic gradient descent with a sufficiently small learning rate and suitable initialization.
Rawlsian Fair Adaptation of Deep Learning Classifiers
Given any score function or feature representation and only its second-order statistics on the sensitive sub-populations, we seek a threshold classifier on the given score or a linear threshold classifier on the given feature representation that achieves the Rawls error rate restricted to this hypothesis class.
Learning and Generalization in Univariate Overparameterized Normalizing Flows
In supervised learning, it is known that overparameterized neural networks with one hidden layer provably and efficiently learn and generalize, when trained using Stochastic Gradient Descent (SGD).
Online Active Learning of Reject Option Classifiers
In this paper, we propose novel algorithms for active learning of reject option classifiers.
PLUME: Polyhedral Learning Using Mixture of Experts
In this paper, we propose a novel mixture of expert architecture for learning polyhedral classifiers.
Sparse Reject Option Classifier Using Successive Linear Programming
We also show that the excess risk of loss $L_d$ is upper bounded by the excess risk of $L_{dr}$.
