MLINFO COLLECTION

Bayesian Optimization

少数試行で条件探索を進めるベイズ最適化、実験計画、ブラックボックス最適化を扱います。

記事一覧

11 / 18
arxiv

The Information Geometry of Representation Formation

Most analyses of neural representations focus on trained endpoints, leaving the process by which internal structure forms comparatively unmeasured. We instead treat representation formation itself as…

deep-learning
arxiv

Confessions of a Masked MDP

In reinforcement learning, one presumes the action set to be known ahead of time, and, thus, one must know if any state-action pairs are not permissible ahead of computations. In some applications,…

deep-learning
arxiv

Designing Experiments for External Decision Makers

Standard Bayesian experimental design (BED) methods assume the experimenter alone will act on the data, choosing the best action given their own beliefs and goals. In practice, data are often acted…

nlp
arxiv

Approximate Universal Prediction under Interaction

Bayesian mixtures, and Solomonoff induction in particular, provide an idealized model of prediction learned by minimizing population log loss, and they underlie universal agents such as AIXI. An…

deep-learning
arxiv

k-Submodular Cover Problem with a Matroid Constraint

We investigate k-submodular cover problem with a matroid constraint on an n-element ground set V , which seeks k disjoint subsets of V with minimal cost, where their union is an independent set for…

math-theory
arxiv

Tight Inapproximability for Generalized Circuits

Generalized circuits are a fundamental tool for establishing PPAD-hardness and membership of approximate equilibrium problems. Despite their importance, the complexity of finding approximate…

math-theory
arxiv

A Simple and General Approach to top-$k$ Selection

This paper considers the Bayesian top-$k$ identification problem, wherein a decision maker is tasked with selecting $k$ items from a pool of items of unknown quality. To assess the items, the…

computer-vision