Stochastic Maximum Likelihood Optimization via Hypernetworks
This work explores maximum likelihood optimization of neural networks through hypernetworks. A hypernetwork initializes the weights of another network, which in turn can be employed for typical functional tasks such as regression and classification. We optimize hypernetworks to directly maximize the conditional likelihood of target variables given input. Using this approach we obtain competitive empirical results on regression and classification benchmarks.
Code (0)
등록된 구현이 없습니다.
Tasks
ClassificationGeneral ClassificationregressionMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Faster Stochastic First-Order Method for Maximum-Likelihood Quantum State Tomography
In maximum-likelihood quantum state tomography, both the sample size and dimension grow exponentially with the number of qubits. It is therefore desirable to develop a stochastic first-order method, just like stochastic …
Quantum State TomographyA Gated Hypernet Decoder for Polar Codes
Hypernetworks were recently shown to improve the performance of message passing algorithms for decoding error correcting codes. In this work, we demonstrate how hypernetworks can be applied to decode polar codes by emplo…
DecoderVariational Inference for Quantum HyperNetworks
Binary Neural Networks (BiNNs), which employ single-bit precision weights, have emerged as a promising solution to reduce memory usage and power consumption while maintaining competitive performance in large-scale system…
Bayesian InferenceVariational InferenceStochastic Hyperparameter Optimization through Hypernetworks
Machine learning models are often tuned by nesting optimization of model weights inside the optimization of hyperparameters. We give a method to collapse this nested optimization into joint stochastic optimization of wei…
BIG-bench Machine LearningHyperparameter OptimizationStochastic OptimizationMaximum Likelihood Constraint Inference from Stochastic Demonstrations
When an expert operates a perilous dynamic system, ideal constraint information is tacitly contained in their demonstrated trajectories and controls. The likelihood of these demonstrations can be computed, given the syst…