Tutorial on amortized optimization Learning to optimize over continuous spaces

Martín Abadi, Paul Barham, Jianmin Chen, Zhifeng Chen, Andy Davis, Jeffrey Dean, Matthieu Devin, Sanjay Ghemawat, Geoffrey Irving, Michael Isard, et al. Tensorflow: A system for large-scale machine learning. In 12th USENIX symposium on operating systems design and implementation (OSDI 16), pages 265–283, 2016. (Cited on page 60.)
『Tensorflow：大規模機械学習のためのシステム』

P-A Absil, Robert Mahony, and Rodolphe Sepulchre. Optimization algorithms on matrix manifolds. Princeton University Press, 2009. (Cited on page 28.)
『行列多様体上の最適化アルゴリズム』

Ryan Prescott Adams and Richard S Zemel. Ranking via sinkhorn propagation. arXiv preprint arXiv:1106.1925, 2011. (Cited on page 27.)
『シンクホーン伝播によるランキング』

Jonas Adler, Axel Ringh, Ozan Öktem, and Johan Karlsson. Learning to solve inverse problems using wasserstein loss. ArXiv preprint, abs/1710.10898, 2017. (Cited on page 15.)
『Wasserstein損失を用いた逆問題の解法学習』

Akshay Agrawal, Brandon Amos, Shane T. Barratt, Stephen P. Boyd, Steven Diamond, and J. Zico Kolter. Differentiable convex optimization layers. In NeurIPS, pages 9558–9570, 2019a. (Cited on pages 13, 30, 67, and 73.)
『微分可能な凸最適化層』

Akshay Agrawal, Akshay Naresh Modi, Alexandre Passos, Allen Lavoie, Ashish Agarwal, Asim Shankar, Igor Ganichev, Josh Levenberg, Mingsheng Hong, Rajat Monga, and Shanqing Cai. Tensorflow eager: A multi-stage, python-embedded DSL for machine learning. In MLSys, 2019b. (Cited on page 60.)
『機械学習のための多段階Python埋め込みDSL』

Alfred V Aho, Ravi Sethi, and Jeffrey D Ullman. Compilers, principles, techniques. Addison wesley, 7(8):9, 1986. (Cited on page 18.)
『コンパイラ、原理、テクニック』

Rami Al-Rfou, Guillaume Alain, Amjad Almahairi, Christof Angermueller, Dzmitry Bahdanau, Nicolas Ballas, Frédéric Bastien, Justin Bayer, Anatoly Belikov, Alexander Belopolsky, et al. Theano: A python framework for fast computation of mathematical expressions. arXiv e-prints, pages arXiv–1605, 2016. (Cited on page 60.)
『数式を高速に計算するためのPythonフレームワーク』

Daniel Alabi, Adam Tauman Kalai, Katrina Ligett, Cameron Musco, Christos Tzamos, and Ellen Vitercik. Learning to prune: Speeding up repeated computations. In COLT, volume 99, pages 30–33, 2019. (Cited on page 76.)
『剪定を学ぶ：繰り返し計算の高速化』

Alnur Ali, Eric Wong, and J. Zico Kolter. A semismooth newton method for fast, generic convex programming. In ICML, volume 70, pages 70–79, 2017. (Cited on pages 26 and 27.)
『高速で汎用的な凸計画法のための半平滑ニュートン法』

Eugene L Allgower and Kurt Georg. Numerical continuation methods: an introduction, volume 13. Springer Science & Business Media, 2012. (Cited on page 76.)
『数値継続法入門、第13巻』

Brandon Amos. Differentiable Optimization-Based Modeling for Machine Learning. PhD thesis, Carnegie Mellon University, 2019. (Cited on pages 13, 25, 30, and 73.)
『機械学習のための微分可能最適化に基づくモデリング.』(カーネギーメロン大学博士論文)

Brandon Amos. On amortizing convex conjugates for optimal transport. In The ICLR, 2023. (Cited on page 48.)
『最適輸送のための凸共役の償却について』

Brandon Amos and J. Zico Kolter. Optnet: Differentiable optimization as a layer in neural networks. In ICML, volume 70, pages 136–145, 2017. (Cited on pages 13, 30, and 73.)
『Optnet：ニューラルネットワークにおける層としての微分可能最適化』

Brandon Amos and Denis Yarats. The differentiable cross-entropy method. In ICML, volume 119, pages 291–302, 2020. (Cited on pages 10, 56, 59, and 74.)
『微分可能クロスエントロピー法』

Brandon Amos, Lei Xu, and J. Zico Kolter. Input convex neural networks. In ICML, volume 70, pages 146–155, 2017. (Cited on pages 10 and 47.)
『入力凸ニューラルネットワーク』

Brandon Amos, Ivan Dario Jimenez Rodriguez, Jacob Sacks, Byron Boots, and J. Zico Kolter. Differentiable MPC for end-to-end planning and control. In NeurIPS, pages 8299–8310, 2018. (Cited on page 56.)
『エンドツーエンドの計画と制御のための微分可能MPC』

Brandon Amos, Vladlen Koltun, and J Zico Kolter. The limited multi-label projection layer. ArXiv preprint, abs/1906.08707, 2019. (Cited on pages 27 and 56.)
『限定されたマルチラベル投影層』

Brandon Amos, Samuel Stanton, Denis Yarats, and Andrew Gordon Wilson. On the model-based stochastic value gradient for continuous reinforcement learning. In L4DC, pages 6–20, 2021. (Cited on pages 4, 22, 53, 54, and 64.)
『連続強化学習のためのモデルベースの確率的価値勾配について』

Brandon Amos, Samuel Cohen, Giulia Luise, and Ievgen Redko. Meta optimal transport. ArXiv preprint, abs/2206.05262, 2022. (Cited on page 46.)
『メタ最適輸送』

Donald G Anderson. Iterative procedures for nonlinear integral equations. Journal of the ACM (JACM), 12(4):547–560, 1965. (Cited on page 41.)
『非線形積分方程式の反復法』

Marcin Andrychowicz, Misha Denil, Sergio Gomez Colmenarejo, Matthew W. Hoffman, David Pfau, Tom Schaul, and Nando de Freitas. Learning to learn by gradient descent by gradient descent. In NeurIPS, pages 3981–3989, 2016. (Cited on pages 9, 10, and 38.)
『勾配降下法による学習方法の学習』

Antreas Antoniou, Harrison Edwards, and Amos J. Storkey. How to train your MAML. In ICLR, 2019. (Cited on page 12.)
『MAMLのトレーニング方法』

Michael Arbel and Julien Mairal. Amortized implicit differentiation for stochastic bilevel optimization. In ICLR, 2022. (Cited on page 11.)
『確率的二水準最適化のための償却暗黙微分法』

Martín Arjovsky, Soumith Chintala, and Léon Bottou. Wasserstein generative adversarial networks. In ICML, volume 70, pages 214–223, 2017. (Cited on page 46.)
『Wasserstein生成的敵対ネットワーク』

Sébastien MR Arnold, Praateek Mahajan, Debajyoti Datta, Ian Bunner, and Konstantinos Saitas Zarkias. learn2learn: A library for meta-learning research. ArXiv preprint, abs/2008.12284, 2020. (Cited on page 68.)
『メタ学習研究のためのライブラリ』

Jimmy Lei Ba, Jamie Ryan Kiros, and Geoffrey E. Hinton. Layer normalization. arXiv e-prints, 2016. (Cited on page 70.)
『レイヤー正規化』

Juhan Bae, Paul Vicol, Jeff Z HaoChen, and Roger Grosse. Amortized proximal optimization. ArXiv preprint, abs/2203.00089, 2022. (Cited on page 48.)
『償却近似最適化』

Shaojie Bai, J. Zico Kolter, and Vladlen Koltun. Deep equilibrium models. In NeurIPS, pages 688–699, 2019. (Cited on pages 9, 20, 30, 43, 44, and 73.)
『深い平衡モデル』

Shaojie Bai, Vladlen Koltun, and J. Zico Kolter. Multiscale deep equilibrium models. In NeurIPS, 2020. (Cited on pages 9, 30, 43, 44, and 73.)
『マルチスケールの深い平衡モデル』

Shaojie Bai, Vladlen Koltun, and J. Zico Kolter. Neural deep equilibrium solvers. In ICLR, 2022. (Cited on pages 9, 43, 44, 71, and 73.)
『ニューラルの深層平衡ソルバー』

Leemon Baird. Residual algorithms: Reinforcement learning with function approximation. In Machine Learning Proceedings 1995, pages 30–37. Elsevier, 1995. (Cited on page 58.)
『残差アルゴリズム：関数近似を用いた強化学習』

Kyri Baker. Learning warm-start points for ac optimal power flow. In 2019 IEEE 29th International Workshop on Machine Learning for Signal Processing (MLSP), pages 1–6. IEEE, 2019. (Cited on pages 11 and 24.)
『AC最適電力フローのためのウォームスタートポイントの学習』

Maria-Florina Balcan. Data-driven algorithm design. ArXiv preprint, abs/2011.07177, 2020. (Cited on page 76.)
『データ駆動型アルゴリズム設計』

Ashis Gopal Banerjee and Nicholas Roy. Eficiently solving repeated integer linear programming problems by learning solutions of similar linear programming problems using boosting trees. MIT, 2015. (Cited on page 76.)
『ブースティング木を用いて類似の線形計画問題の解を学習することにより、繰り返し発生する整数線形計画問題を効率的に解く』

Sebastian Banert, Axel Ringh, Jonas Adler, Johan Karlsson, and Ozan Oktem. Data-driven nonsmooth optimization. SIAM Journal on Optimization, 30(1):102–131, 2020. (Cited on page 75.)
『データ駆動型非平滑最適化』

Sebastian Banert, Jevgenija Rudzusika, Ozan Öktem, and Jonas Adler. Accelerated forward-backward optimization using deep learning. ArXiv preprint, abs/2105.05210, 2021. (Cited on page 70.)
『ディープラーニングを用いた高速フォワード・バックワード最適化』

Bernd Bank, Jürgen Guddat, Diethard Klatte, Bernd Kummer, and Klaus Tammer. Non-linear parametric optimization. Springer, 1982. (Cited on pages 2 and 30.)
『非線形パラメトリック最適化』

Shane Barratt. On the differentiability of the solution to convex optimization problems. ArXiv preprint, abs/1804.05098, 2018. (Cited on page 30.)
『凸最適化問題の解の微分可能性について』

Jonathan Baxter. Theoretical models of learning to learn. In Learning to learn, pages 71–94. Springer, 1998. (Cited on page 36.)
『学習の理論モデル』

Amir Beck and Marc Teboulle. A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM journal on imaging sciences, 2(1):183–202, 2009. (Cited on pages 9 and 35.)
『線形逆問題のための高速反復収縮閾値アルゴリズム』

David Belanger. Deep energy-based models for structured prediction. PhD thesis, University of Massachusetts Amherst, 2017. (Cited on page 18.)
『構造予測のための深層エネルギーベースモデル.』(博士論文)

David Belanger and Andrew McCallum. Structured prediction energy networks. In ICML, volume 48, pages 983–992, 2016. (Cited on page 18.)
『構造化予測エネルギーネットワーク』

David Belanger, Bishan Yang, and Andrew McCallum. End-to-end learning for structured prediction energy networks. In ICML, volume 70, pages 429–439, 2017. (Cited on pages 9, 12, and 18.)
『構造化予測エネルギーネットワークのためのエンドツーエンド学習』

Richard Bellman. Dynamic programming. Science, 153(3731):34–37, 1966. (Cited on page 58.)
『動的計画法』

Irwan Bello, Barret Zoph, Vijay Vasudevan, and Quoc V. Le. Neural optimizer search with reinforcement learning. In ICML, volume 70, pages 459–468, 2017. (Cited on page 28.)
『強化学習を用いたニューラル・オプティマイザー探索』

Samy Bengio, Yoshua Bengio, and Jocelyn Cloutier. Use of genetic programming for the search of a new learning rule for neural networks. In First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence, pages 324–327. IEEE, 1994. (Cited on page 28.)
『ニューラルネットワークの新たな学習規則の探索における遺伝的プログラミングの利用』

Yoshua Bengio, Andrea Lodi, and Antoine Prouvost. Machine learning for combinatorial optimization: a methodological tour d’horizon. European Journal of Operational Research, 290(2):405–421, 2021. (Cited on page 76.)
『組み合わせ最適化のための機械学習：方法論的展望』

Luca Bertinetto, João F. Henriques, Philip H. S. Torr, and Andrea Vedaldi. Meta-learning with differentiable closed-form solvers. In ICLR, 2019. (Cited on page 39.)
『微分可能閉形式ソルバーを用いたメタ学習』

Federico Berto, Stefano Massaroli, Michael Poli, and Jinkyoo Park. Neural solvers for fast and accurate numerical optimal control. In ICLR, 2022. (Cited on page 76.)
『高速かつ高精度な数値最適制御のためのニューラルソルバー』

Dimitri Bertsekas. Convex optimization algorithms. Athena Scientific, 2015. (Cited on page 3.)
『凸最適化アルゴリズム』

Dimitri P Bertsekas. Control of uncertain systems with a set-membership description of the uncer-tainty. PhD thesis, Massachusetts Institute of Technology, 1971. (Cited on page 30.)
『不確実性の集合メンバーシップ記述による不確実システムの制御』(博士論文)

Dimitri P. Bertsekas. Dynamic Programming and Optimal Control. Athena Scientific, 2nd edition, 2000. ISBN 1886529094. (Cited on page 50.)
『動的計画法と最適制御』

Dimitris Bertsimas and Bartolomeo Stellato. Online mixed-integer optimization in milliseconds. ArXiv preprint, abs/1907.02206, 2019. (Cited on page 76.)
『ミリ秒単位のオンライン混合整数最適化』

Dimitris Bertsimas and Bartolomeo Stellato. The voice of optimization. Machine Learning, 110(2): 249–277, 2021. (Cited on page 76.)
『最適化の声』

Jeff Bezanson, Alan Edelman, Stefan Karpinski, and Viral B Shah. Julia: A fresh approach to numerical computing. SIAM review, 59(1):65–98, 2017. (Cited on page 60.)
『数値計算への新たなアプローチ』

Mohak Bhardwaj, Byron Boots, and Mustafa Mukadam. Differentiable gaussian process motion planning. In IEEE International Conference on Robotics and Automation (ICRA), pages 10598– 10604. IEEE, 2020. (Cited on page 18.)
『微分可能ガウス過程動作計画』

Jan Blechschmidt and Oliver G Ernst. Three ways to solve partial differential equations with neural networks—a review. GAMM-Mitteilungen, page e202100006, 2021. (Cited on page 76.)
『ニューラルネットワークを用いた偏微分方程式の3つの解法—レビュー』

David M Blei, Alp Kucukelbir, and Jon D McAuliffe. Variational inference: A review for statisticians. Journal of the American statistical Association, 112(518):859–877, 2017. (Cited on page 32.)
『変分推論：統計学者のためのレビュー』

Mathieu Blondel. Structured prediction with projection oracles. In NeurIPS, pages 12145–12156, 2019. (Cited on page 27.)
『投影オラクルを用いた構造化予測』

Mathieu Blondel, André FT Martins, and Vlad Niculae. Learning with fenchel-young losses. J. Mach. Learn. Res., 21(35):1–69, 2020. (Cited on page 27.)
『フェンチェル・ヤング損失を用いた学習』

Mathieu Blondel, Quentin Berthet, Marco Cuturi, Roy Frostig, Stephan Hoyer, Felipe Llinares-López, Fabian Pedregosa, and Jean-Philippe Vert. Efficient and modular implicit differentiation. ArXiv preprint, abs/2105.15183, 2021. (Cited on page 68.)
『効率的かつモジュール式の暗黙的な微分』

J Frédéric Bonnans and Alexander Shapiro. Perturbation analysis of optimization problems. Springer Science & Business Media, 2013. (Cited on pages 2 and 30.)
『最適化問題の摂動解析』

Stephen Boyd, Stephen P Boyd, and Lieven Vandenberghe. Convex optimization. Cambridge university press, 2004. (Cited on page 3.)
『凸最適化』

Stephen Boyd, Neal Parikh, and Eric Chu. Distributed optimization and statistical learning via the alternating direction method of multipliers. Now Publishers Inc, 2011. (Cited on page 43.)
『交互方向乗算法による分散最適化と統計学習』

James Bradbury, Roy Frostig, Peter Hawkins, Matthew James Johnson, Chris Leary, Dougal Maclaurin, and Skye Wanderman-Milne. Jax: composable transformations of python+ numpy programs, 2018. 4:16, 2020. (Cited on pages 12 and 60.)
『Jax: Python+NumPyプログラムの合成可能な変換』

Greg Brockman, Vicki Cheung, Ludwig Pettersson, Jonas Schneider, John Schulman, Jie Tang, and Wojciech Zaremba. Openai gym. ArXiv preprint, abs/1606.01540, 2016. (Cited on page 63.)
『OpenAIジム』

Charles G Broyden. A class of methods for solving nonlinear simultaneous equations. Mathematics of computation, 19(92):577–593, 1965. (Cited on page 41.)
『非線形連立方程式を解くための一連の方法』

Sébastien Bubeck et al. Convex optimization: Algorithms and complexity. Foundations and Trends® in Machine Learning, 8(3-4):231–357, 2015. (Cited on page 3.)
『凸最適化：アルゴリズムと複雑性』

Charlotte Bunne, Andreas Krause, and Marco Cuturi. Supervised training of conditional monge maps. ArXiv preprint, abs/2206.14262, 2022. (Cited on page 47.)
『条件付きモンジュ写像の教師あり学習』

Christopher P Burgess, Irina Higgins, Arka Pal, Loic Matthey, Nick Watters, Guillaume Desjardins, and Alexander Lerchner. Understanding disentangling in β-vae. ArXiv preprint, abs/1804.03599, 2018. (Cited on page 62.)
『β-vaeにおける分離の理解』

Enzo Busseti, Walaa M Moursi, and Stephen Boyd. Solution refinement at regular points of conic problems. Computational Optimization and Applications, 74(3):627–643, 2019. (Cited on page 26.)
『円錐問題の正則点における解の改良』

Arunkumar Byravan, Jost Tobias Springenberg, Abbas Abdolmaleki, Roland Hafner, Michael Neunert, Thomas Lampe, Noah Siegel, Nicolas Heess, and Martin Riedmiller. Imagined value gradients: Model-based policy optimization with transferable latent dynamics models. ArXiv preprint, abs/1910.04142, 2019. (Cited on pages 53 and 54.)
『想像上の価値勾配：転移可能な潜在ダイナミクスモデルを用いたモデルベース政策最適化』

Arunkumar Byravan, Leonard Hasenclever, Piotr Trochim, Mehdi Mirza, Alessandro Davide Ialongo, Yuval Tassa, Jost Tobias Springenberg, Abbas Abdolmaleki, Nicolas Heess, Josh Merel, and Martin A. Riedmiller. Evaluating model-based planning and planner amortization for continuous control. In ICLR, 2022. (Cited on pages 53 and 54.)
『連続制御のためのモデルベースプランニングとプランナー償却の評価』

Eduardo F Camacho and Carlos Bordons Alba. Model predictive control. Springer science & business media, 2013. (Cited on page 50.)
『モデル予測制御』

Quentin Cappart, Didier Chételat, Elias Khalil, Andrea Lodi, Christopher Morris, and Petar Veličković. Combinatorial optimization and reasoning with graph neural networks. ArXiv preprint, abs/2102.09544, 2021. (Cited on page 76.)
『グラフニューラルネットワークを用いた組合せ最適化と推論』

Michael Carter. Foundations of mathematical economics. MIT press, 2001. (Cited on page 30.)
『数理経済学の基礎』

Rich Caruana. Multitask learning. Machine learning, 28(1):41–75, 1997. (Cited on page 36.)
『マルチタスク学習』

Abhishek Cauligi, Preston Culbertson, Bartolomeo Stellato, Dimitris Bertsimas, Mac Schwager, and Marco Pavone. Learning mixed-integer convex optimization strategies for robot planning and control. In IEEE Conference on Decision and Control (CDC), pages 1698–1705. IEEE, 2020. (Cited on page 76.)
『ロボットの計画と制御のための混合整数凸最適化戦略の学習』

Abhishek Cauligi, Preston Culbertson, Edward Schmerling, Mac Schwager, Bartolomeo Stellato, and Marco Pavone. Coco: Online mixed-integer control via supervised learning. IEEE Robotics and Automation Letters, 2021. (Cited on page 76.)
『教師あり学習によるオンライン混合整数制御』

Yash Chandak, Georgios Theocharous, James Kostas, Scott M. Jordan, and Philip S. Thomas. Learning action representations for reinforcement learning. In ICML, volume 97, pages 941–950, 2019. (Cited on page 76.)
『強化学習のための行動表現の学習』

Jen-Hao Rick Chang, Chun-Liang Li, Barnabás Póczos, and B. V. K. Vijaya Kumar. One network to solve them all - solving linear inverse problems using deep projection models. In ICCV, 2017. (Cited on page 74.)
『一つのネットワークで全てを解決 ― 深層投影モデルを用いた線形逆問題の解法』

François Charton. Linear algebra with transformers. ArXiv preprint, abs/2112.01898, 2021. (Cited on page 76.)
『線形代数とトランスフォーマー』

François Charton, Amaury Hayat, Sean T McQuade, Nathaniel J Merrill, and Benedetto Piccoli. A deep language model to predict metabolic network equilibria. ArXiv preprint, abs/2112.03588, 2021. (Cited on page 76.)
『代謝ネットワークの平衡を予測するための深層言語モデル』

Justin Y. Chen, Sandeep Silwal, Ali Vakilian, and Fred Zhang. Faster fundamental graph algorithms via learned predictions. In ICML, volume 162, pages 3583–3602, 2022a. (Cited on page 76.)
『学習予測による基本グラフアルゴリズムの高速化』

Scott Shaobing Chen, David L Donoho, and Michael A Saunders. Atomic decomposition by basis pursuit. SIAM review, 43(1):129–159, 2001. (Cited on page 35.)
『基底追求による原子分解』

Steven W Chen, Tianyu Wang, Nikolay Atanasov, Vijay Kumar, and Manfred Morari. Large scale model predictive control with neural networks and primal active sets. Automatica, 135:109947, 2022b. (Cited on page 11.)
『ニューラルネットワークとプライマルアクティブセットを用いた大規模モデル予測制御』

Tianlong Chen, Xiaohan Chen, Wuyang Chen, Howard Heaton, Jialin Liu, Zhangyang Wang, and Wotao Yin. Learning to optimize: A primer and a benchmark. ArXiv preprint, abs/2103.12828, 2021a. (Cited on pages 35, 69, and 74.)
『最適化の学習: 入門書とベンチマーク』

Tianqi Chen, Bing Xu, Chiyuan Zhang, and Carlos Guestrin. Training deep nets with sublinear memory cost. ArXiv preprint, abs/1604.06174, 2016. (Cited on page 12.)
『サブ線形メモリコストを用いたディープネットの学習』

Yifan Chen, Bamdad Hosseini, Houman Owhadi, and Andrew M Stuart. Solving and learning nonlinear pdes with gaussian processes. ArXiv preprint, abs/2103.12959, 2021b. (Cited on page 76.)
『ガウス過程を用いた非線形偏微分方程式の解法と学習』

Yutian Chen, Matthew W. Hoffman, Sergio Gomez Colmenarejo, Misha Denil, Timothy P. Lillicrap, Matthew Botvinick, and Nando de Freitas. Learning to learn without gradient descent by gradient descent. In ICML, volume 70, pages 748–756, 2017. (Cited on pages 29 and 38.)
『勾配降下法を用いずに勾配降下法で学習する方法の学習』

Yutian Chen, Abram L. Friesen, Feryal Behbahani, Arnaud Doucet, David Budden, Matthew Hoffman, and Nando de Freitas. Modular meta-learning with shrinkage. In NeurIPS, 2020. (Cited on pages 20 and 73.)
『収縮を伴うモジュール型メタ学習』

Kyunghyun Cho, Bart van Merriënboer, Caglar Gulcehre, Dzmitry Bahdanau, Fethi Bougares, Holger Schwenk, and Yoshua Bengio. Learning phrase representations using RNN encoder–decoder for statistical machine translation. In EMNLP, Doha, Qatar, 2014. (Cited on page 10.)
『統計的機械翻訳におけるRNNエンコーダー・デコーダーを用いたフレーズ表現の学習』

Junyoung Chung, Kyle Kastner, Laurent Dinh, Kratarth Goel, Aaron C. Courville, and Yoshua Bengio. A recurrent latent variable model for sequential data. In NeurIPS, pages 2980–2988, 2015. (Cited on page 34.)
『シーケンシャルデータのための再帰型潜在変数モデル』

Samuel Cohen, Brandon Amos, and Yaron Lipman. Riemannian convex potential maps. In ICML, volume 139, pages 2028–2038, 2021. (Cited on page 66.)
『リーマン凸ポテンシャル写像』

Thomas M Cover and Joy A Thomas. Elements of information theory (wiley series in telecommuni-cations and signal processing), 2006. (Cited on page 23.)
『情報理論の要素』

Chris Cremer, Xuechen Li, and David Duvenaud. Inference suboptimality in variational autoencoders. In ICML, volume 80, pages 1086–1094, 2018. (Cited on pages 7, 34, 61, and 73.)
『変分オートエンコーダにおける推論の準最適性』

Rodrigo Santa Cruz, Basura Fernando, Anoop Cherian, and Stephen Gould. Deeppermnet: Visual permutation learning. In CVPR, 2017. (Cited on page 27.)
『詳細なトピック：視覚的順列学習』

Marco Cuturi. Sinkhorn distances: Lightspeed computation of optimal transport. In NeurIPS, pages 2292–2300, 2013. (Cited on pages 46 and 47.)
『シンクホーン距離：光速における最適輸送計算』

Marco Cuturi and Mathieu Blondel. Soft-dtw: a differentiable loss function for time-series. In ICML, volume 70, pages 894–903, 2017. (Cited on page 67.)
『Soft-dtw：時系列のための微分可能損失関数』

Nhan Dam, Quan Hoang, Trung Le, Tu Dinh Nguyen, Hung Bui, and Dinh Phung. Three-player wasserstein GAN via amortised duality. In IJCAI, pages 2202–2208, 2019. doi: 10.24963/ijcai. 2019/305. (Cited on page 48.)
『償却双対性を用いた3人用Wasserstein GAN』

John M Danskin. The theory of max-min, with applications. SIAM Journal on Applied Mathematics, 14(4):641–664, 1966. (Cited on page 30.)
『最大最小理論とその応用』

Stéphane d’Ascoli, Pierre-Alexandre Kamienny, Guillaume Lample, and François Charton. Deep symbolic regression for recurrent sequences, 2022. (Cited on page 76.)
『反復シーケンスに対する深いシンボリック回帰』

Ingrid Daubechies, Michel Defrise, and Christine De Mol. An iterative thresholding algorithm for linear inverse problems with a sparsity constraint. Communications on Pure and Applied Mathematics: A Journal Issued by the Courant Institute of Mathematical Sciences, 57(11): 1413–1457, 2004. (Cited on pages 9 and 35.)
『スパース制約付き線形逆問題のための反復閾値アルゴリズム』

Jack W Davidson and Sanjay Jinturkar. An aggressive approach to loop unrolling. Technical report, Citeseer, 1995. (Cited on page 18.)
『ループアンローリングへの積極的なアプローチ』

Peter Dayan, Geoffrey E Hinton, Radford M Neal, and Richard S Zemel. The helmholtz machine. Neural computation, 7(5):889–904, 1995. (Cited on page 32.)
『ヘルムホルツマシン. ニューラルコンピューティング』

Pieter-Tjerk De Boer, Dirk P Kroese, Shie Mannor, and Reuven Y Rubinstein. A tutorial on the cross-entropy method. Annals of operations research, 134(1):19–67, 2005. (Cited on page 10.)
『クロスエントロピー法のチュートリアル』

Marc Peter Deisenroth and Carl Edward Rasmussen. PILCO: A model-based and data-eficient approach to policy search. In ICML, pages 465–472, 2011. (Cited on page 54.)
『PILCO：モデルベースかつデータ効率の高い政策探索アプローチ』

Marc Peter Deisenroth, A Aldo Faisal, and Cheng Soon Ong. Mathematics for machine learning. Cambridge University Press, 2020. (Cited on page 3.)
『機械学習のための数学』

Tristan Deleu, Tobias Würfl, Mandana Samiei, Joseph Paul Cohen, and Yoshua Bengio. Torchmeta: A meta-learning library for pytorch. ArXiv preprint, abs/1909.06576, 2019. (Cited on page 68.)
『Torchmeta: Python Torch用メタ学習ライブラリ』

Ishan Deshpande, Yuan-Ting Hu, Ruoyu Sun, Ayis Pyrros, Nasir Siddiqui, Sanmi Koyejo, Zhizhen Zhao, David A. Forsyth, and Alexander G. Schwing. Max-sliced wasserstein distance and its use for gans. In CVPR, 2019. (Cited on page 48.)
『Wasserstein 距離とGANSへの応用』

Steven Diamond and Stephen Boyd. The Journal of Machine Learning Research, 17(1):2909–2913, 2016. (Cited on pages 67 and 73.)
『機械学習研究ジャーナル』

Ulisse Dini. Analisi infinitesimale. Lithografia Gorani, 1878. (Cited on page 31.)
『微小分析』

Michael Dinitz, Sungjin Im, Thomas Lavastida, Benjamin Moseley, and Sergei Vassilvitskii. Faster matchings via learned duals. In NeurIPS, pages 10393–10406, 2021. (Cited on pages 46 and 76.)
『学習済み双対による高速マッチング』

Carl Doersch. Tutorial on variational autoencoders. ArXiv preprint, abs/1606.05908, 2016. (Cited on page 32.)
『変分オートエンコーダのチュートリアル』

Justin Domke. Generic methods for optimization-based modeling. In AISTATS, pages 318–326, 2012. (Cited on pages 11, 13, 30, and 73.)
『最適化に基づくモデリングのための汎用手法』

Wenqian Dong, Zhen Xie, Gokcen Kestor, and Dong Li. Smart-pgsim: using neural network to accelerate ac-opf power grid simulation. In SC20: International Conference for High Performance Computing, Networking, Storage and Analysis, pages 1–15. IEEE, 2020. (Cited on page 24.)
『ニューラルネットワークを用いたAC-OPF電力網シミュレーションの高速化』

David L Donoho and Michael Elad. Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ1 minimization. Proceedings of the National Academy of Sciences, 100(5): 2197–2202, 2003. (Cited on page 35.)
『ℓ1最小化による一般（非直交）辞書における最適スパース表現』

Asen L Dontchev and R Tyrrell Rockafellar. Implicit functions and solution mappings, volume 543. Springer, 2009. (Cited on page 31.)
『暗黙関数と解のマッピング』

Priya L. Donti, David Rolnick, and J. Zico Kolter. DC3: A learning method for optimization with hard constraints. In ICLR, 2021. (Cited on page 24.)
『ハード制約を考慮した最適化のための学習手法』

Iddo Drori, Sunny Tran, Roman Wang, Newman Cheng, Kevin Liu, Leonard Tang, Elizabeth Ke, Nikhil Singh, Taylor L. Patti, Jayson Lynch, Avi Shporer, Nakul Verma, Eugene Wu, and Gilbert Strang. A neural network solves and generates mathematics problems by program synthesis: Calculus, differential equations, linear algebra, and more, 2021. (Cited on page 76.)
『ニューラルネットワークはプログラム合成によって数学の問題を解いたり生成したりする』

John C. Duchi, Elad Hazan, and Yoram Singer. Adaptive subgradient methods for online learning and stochastic optimization. In COLT, pages 257–269, 2010. (Cited on pages 14 and 28.)
『オンライン学習と確率的最適化のための適応型劣勾配法』

Iain Dunning, Joey Huchette, and Miles Lubin. Jump: A modeling language for mathematical optimization. SIAM Review, 59(2):295–320, 2017. doi: 10.1137/15M1020575. (Cited on page 68.)
『数理最適化のためのモデリング言語』

Emilien Dupont. Learning disentangled joint continuous and discrete representations. In NeurIPS, pages 708–718, 2018. (Cited on page 61.)
『分離した連続表現と離散表現の学習』

Valentin Duruisseaux and Melvin Leok. Accelerated optimization on riemannian manifolds via projected variational integrators, 2022. (Cited on page 28.)
『射影変分積分器を用いたリーマン多様体上の高速最適化』

Damien Ernst, Pierre Geurts, and Louis Wehenkel. Tree-based batch mode reinforcement learning. Journal of Machine Learning Research, 6, 2005. (Cited on page 58.)
『ツリーベースバッチモード強化学習』

Anthony V Fiacco. Mathematical programming with data perturbations. CRC Press, 2020. (Cited on pages 2 and 30.)
『データ摂動を伴う数理計画法』

Anthony V Fiacco and Yo Ishizuka. Sensitivity and stability analysis for nonlinear programming. Annals of Operations Research, 27(1):215–235, 1990. (Cited on pages 2 and 30.)
『非線形計画法の感度解析と安定性解析』

Arnaud Fickinger, Hengyuan Hu, Brandon Amos, Stuart J. Russell, and Noam Brown. Scalable online planning via reinforcement learning fine-tuning. In NeurIPS, pages 16951–16963, 2021. (Cited on page 76.)
『強化学習による微調整によるスケーラブルなオンラインプランニング』

Chelsea Finn, Pieter Abbeel, and Sergey Levine. Model-agnostic meta-learning for fast adaptation of deep networks. In ICML, volume 70, pages 1126–1135, 2017. (Cited on pages 9, 11, 12, 18, 19, 37, 70, and 71.)
『深層ネットワークの高速適応のためのモデル非依存メタ学習』

JL Fleiss. Review papers: The statistical basis of meta-analysis. Statistical methods in medical research, 2(2):121–145, 1993. (Cited on page 39.)
『メタアナリシスの統計的基礎』

Jakob N Foerster, Richard Y Chen, Maruan Al-Shedivat, Shimon Whiteson, Pieter Abbeel, and Igor Mordatch. Learning with opponent-learning awareness. ArXiv preprint, abs/1709.04326, 2017. (Cited on page 18.)
『敵対学習の認識を用いた学習』

Luca Franceschi, Michele Donini, Paolo Frasconi, and Massimiliano Pontil. Forward and reverse gradient-based hyperparameter optimization. In ICML, volume 70, pages 1165–1173, 2017. (Cited on page 19.)
『順方向および逆方向勾配法に基づくハイパーパラメータ最適化』

Luca Franceschi, Paolo Frasconi, Saverio Salzo, Riccardo Grazzi, and Massimiliano Pontil. Bilevel programming for hyperparameter optimization and meta-learning. In ICML, volume 80, pages 1563–1572, 2018. (Cited on page 39.)
『ハイパーパラメータの最適化とメタ学習のための 2 レベルプログラミング』

Scott Fujimoto, Herke van Hoof, and David Meger. Addressing function approximation error in actor-critic methods. In ICML, volume 80, pages 1582–1591, 2018. (Cited on pages 21, 45, and 53.)
『アクター・クリティック法における関数近似誤差への対処』

Scott Fujimoto, David Meger, Doina Precup, Ofir Nachum, and Shixiang Shane Gu. Why should I trust you, bellman? the bellman error is a poor replacement for value error. In ICML, volume 162, pages 6918–6943, 2022. (Cited on page 58.)
『なぜベルマンを信頼すべきなのか？ベルマン誤差は値誤差の代替としては不十分だ』

Zhi Gao, Yuwei Wu, Yunde Jia, and Mehrtash Harandi. Learning to optimize on SPD manifolds. In CVPR, 2020. (Cited on page 28.)
『SPD 多様体での最適化を学習する』

Jezabel R Garcia, Federica Freddi, Stathi Fotiadis, Maolin Li, Sattar Vakili, Alberto Bernacchia, and Guillaume Hennequin. Fisher-legendre (fishleg) optimization of deep neural networks. In ICLR, 2023. (Cited on page 48.)
『ディープニューラルネットワークの Fisher-legendre (フィッシュレッグ) 最適化』

Marta Garnelo, Dan Rosenbaum, Christopher Maddison, Tiago Ramalho, David Saxton, Murray Shanahan, Yee Whye Teh, Danilo Jimenez Rezende, and S. M. Ali Eslami. Conditional neural processes. In ICML, volume 80, pages 1690–1699, 2018. (Cited on page 47.)
『条件付き神経プロセス』

Matthieu Geist, Bilal Piot, and Olivier Pietquin. Is the bellman residual a bad proxy? In NeurIPS, pages 3205–3214, 2017. (Cited on page 58.)
『ベルマン残差は悪い代理変数か？』

Samuel Gershman and Noah Goodman. Amortized inference in probabilistic reasoning. In Proceedings of the annual meeting of the cognitive science society, volume 36, 2014. (Cited on page 7.)
『確率推論における償却推論』

Ian J. Goodfellow, Jonathon Shlens, and Christian Szegedy. Explaining and harnessing adversarial examples. In ICLR, 2015. (Cited on page 12.)
『敵対的事例の説明と活用』

Jonathan Gordon, John Bronskill, Matthias Bauer, Sebastian Nowozin, and Richard E. Turner. Meta-learning probabilistic inference for prediction. In ICLR, 2019. (Cited on page 36.)
『予測のためのメタ学習確率推論』

Stephen Gould, Basura Fernando, Anoop Cherian, Peter Anderson, Rodrigo Santa Cruz, and Edison Guo. On differentiating parameterized argmin and argmax problems with application to bi-level optimization. ArXiv preprint, abs/1607.05447, 2016. (Cited on pages 13, 30, and 73.)
『パラメータ化されたargmin問題とargmax問題の微分化と二段階最適化への応用について』

Riccardo Grazzi, Luca Franceschi, Massimiliano Pontil, and Saverio Salzo. On the iteration complexity of hypergradient computation. In ICML, volume 119, pages 3748–3758, 2020. (Cited on page 68.)
『超勾配計算の反復計算量について』

Edward Grefenstette, Brandon Amos, Denis Yarats, Phu Mon Htut, Artem Molchanov, Franziska Meier, Douwe Kiela, Kyunghyun Cho, and Soumith Chintala. Generalized inner loop meta-learning. ArXiv preprint, abs/1910.01727, 2019. (Cited on page 68.)
『一般化内部ループメタ学習』

Karol Gregor and Yann LeCun. Learning fast approximations of sparse coding. In ICML, pages 399–406, 2010. (Cited on pages 9, 34, 35, 71, and 75.)
『スパース符号化の高速近似学習』

Audrunas Gruslys, Rémi Munos, Ivo Danihelka, Marc Lanctot, and Alex Graves. Memory-eficient backpropagation through time. In NeurIPS, pages 4125–4133, 2016. (Cited on page 12.)
『メモリ効率の高い時間経過バックプロパゲーション』

Radek Grzeszczuk, Demetri Terzopoulos, and Geoffrey Hinton. Neuroanimator: Fast neural network emulation and control of physics-based models. In 25th annual conference on Computer graphics and interactive techniques, pages 9–20, 1998. (Cited on page 76.)
『物理ベースモデルの高速ニューラルネットワークエミュレーションと制御』

Silviu Guiasu and Abe Shenitzer. The principle of maximum entropy. The mathematical intelligencer, 7(1):42–48, 1985. (Cited on page 23.)
『最大エントロピー原理』

Swaminathan Gurumurthy, Shaojie Bai, Zachary Manchester, and J. Zico Kolter. Joint inference and input optimization in equilibrium networks. In NeurIPS, pages 16818–16832, 2021. (Cited on page 43.)
『均衡ネットワークにおける統合推論と入力最適化』

David Ha, Andrew M. Dai, and Quoc V. Le. Hypernetworks. In ICLR, 2017. (Cited on page 36.)
『ハイパーネットワーク』

Tuomas Haarnoja, Aurick Zhou, Kristian Hartikainen, George Tucker, Sehoon Ha, Jie Tan, Vikash Kumar, Henry Zhu, Abhishek Gupta, Pieter Abbeel, et al. Soft actor-critic algorithms and applications. ArXiv preprint, abs/1812.05905, 2018. (Cited on pages 22, 51, 53, 54, and 72.)
『ソフトアクター・クリティックアルゴリズムと応用』

P Habets. Stabilite asyptotique pour des problemes de perturbations singulieres. In Stability Problems, pages 2–18. Springer, 2010. (Cited on page 11.)
『特異摂動問題における漸近安定性』

Danijar Hafner, Timothy P. Lillicrap, Jimmy Ba, and Mohammad Norouzi. Dream to control: Learning behaviors by latent imagination. In ICLR, 2020. (Cited on pages 53 and 54.)
『夢からコントロールへ：潜在的想像力による学習行動』

Tian Han, Yang Lu, Song-Chun Zhu, and Ying Nian Wu. Alternating back-propagation for generator network. In AAAI, pages 1976–1984. AAAI Press, 2017. (Cited on page 18.)
『ジェネレーターネットワークの交互バックプロパゲーション』

Harry F Harlow. The formation of learning sets. Psychological review, 56(1):51, 1949. (Cited on page 36.)
『学習セットの形成』

James Harrison, Luke Metz, and Jascha Sohl-Dickstein. A closer look at learned optimization: Stability, robustness, and inductive biases. ArXiv preprint, abs/2209.11208, 2022. (Cited on page 40.)
『学習最適化の詳細な考察：安定性、堅牢性、そして帰納的バイアス』

Horace He and Richard Zou. functorch: Jax-like composable function transforms for pytorch, 2021. (Cited on page 68.)
『Python 3.0用のJaxのような合成可能な関数変換』

Kaiming He, Xiangyu Zhang, Shaoqing Ren, and Jian Sun. Identity mappings in deep residual networks. In ECCV, pages 630–645. Springer, 2016. (Cited on page 39.)
『深層残差ネットワークにおける恒等写像』

Siyu He, Yin Li, Yu Feng, Shirley Ho, Siamak Ravanbakhsh, Wei Chen, and Barnabás Póczos. Learning to predict the cosmological structure formation. Proceedings of the National Academy of Sciences, 116(28):13825–13832, 2019. (Cited on page 76.)
『宇宙構造形成の予測を学ぶ』

Nicolas Heess, Gregory Wayne, David Silver, Timothy P. Lillicrap, Tom Erez, and Yuval Tassa. Learning continuous control policies by stochastic value gradients. In NeurIPS, pages 2944–2952, 2015. (Cited on pages 51 and 54.)
『確率的価値勾配による連続制御ポリシーの学習』

Mikael Henaff, Alfredo Canziani, and Yann LeCun. Model-predictive policy learning with uncertainty regularization for driving in dense trafic. In ICLR, 2019. (Cited on page 54.)
『不確実性正規化を用いたモデル予測型ポリシー学習による密集交通状況下での運転』

Pascal Van Hentenryck. Optimization learning, 2025. URL https://arxiv.org/abs/2501.03443. (Cited on pages 24 and 75.)
『最適化学習』

Irina Higgins, Loïc Matthey, Arka Pal, Christopher Burgess, Xavier Glorot, Matthew Botvinick, Shakir Mohamed, and Alexander Lerchner. beta-vae: Learning basic visual concepts with a constrained variational framework. In ICLR, 2017. (Cited on page 32.)
『制約付き変分フレームワークを用いた基本的な視覚概念の学習』

Sepp Hochreiter and Jürgen Schmidhuber. Long short-term memory. Neural computation, 9(8): 1735–1780, 1997. (Cited on page 10.)
『長期・短期記憶』

Sepp Hochreiter, A Steven Younger, and Peter R Conwell. Learning to learn using gradient descent. In International Conference on Artificial Neural Networks, pages 87–94. Springer, 2001. (Cited on page 36.)
『勾配降下法を用いた学習の学習』

Matthew D Hoffman, David M Blei, Chong Wang, and John Paisley. Stochastic variational inference. Journal of Machine Learning Research, 14(5), 2013. (Cited on page 34.)
『確率的変分推論』

Timothy Hospedales, Antreas Antoniou, Paul Micaelli, and Amos Storkey. Meta-learning in neural networks: A survey. ArXiv preprint, abs/2004.05439, 2020. (Cited on pages 36 and 75.)
『ニューラルネットワークにおけるメタ学習：概説』

Stephan Hoyer, Jascha Sohl-Dickstein, and Sam Greydanus. Neural reparameterization improves structural optimization. ArXiv preprint, abs/1909.04240, 2019. (Cited on page 10.)
『ニューラルネットワークの再パラメータ化による構造最適化の改善』

Jiang Hu, Xin Liu, Zaiwen Wen, and Yaxiang Yuan. A brief introduction to manifold optimization. ArXiv preprint, abs/1906.05450, 2019. (Cited on page 28.)
『多様体最適化の簡単な入門』

Kejun Huang, Nicholas D Sidiropoulos, and Athanasios P Liavas. A flexible and eficient algorith-mic framework for constrained matrix and tensor factorization. IEEE Transactions on Signal Processing, 64(19):5052–5065, 2016. (Cited on page 43.)
『制約付き行列およびテンソル分解のための柔軟かつ効率的なアルゴリズムフレームワーク』

Tianshu Huang, Tianlong Chen, Sijia Liu, Shiyu Chang, Lisa Amini, and Zhangyang Wang. Optimizer amalgamation. In ICLR, 2022. (Cited on page 40.)
『オプティマイザーの統合』

Ferenc Huszár. Notes on imaml: Meta-learning with implicit gradients. http://inference.vc, 2019. (Cited on pages 20 and 73.)
『imamlに関するメモ：暗黙的勾配を用いたメタ学習』

Jeffrey Ichnowski, Paras Jain, Bartolomeo Stellato, Goran Banjac, Michael Luo, Francesco Borrelli, Joseph E. Gonzalez, Ion Stoica, and Ken Goldberg. Accelerating quadratic optimization with reinforcement learning. In NeurIPS, pages 21043–21055, 2021. (Cited on pages 9, 21, 44, 71, and 73.)
『強化学習による二次最適化の加速』

Herbert Jaeger. Tutorial on training recurrent neural networks, covering BPPT, RTRL, EKF and the" echo state network" approach, volume 5. GMD-Forschungszentrum Informationstechnik Bonn, 2002. (Cited on page 18.)
『エコーステートネットワーク」アプローチをカバーするリカレントニューラルネットワークのトレーニングに関するチュートリアル』

Yeonwoo Jeong and Hyun Oh Song. Learning discrete and continuous factors of data via alternating disentanglement. In ICML, volume 97, pages 3091–3099, 2019. (Cited on page 76.)
『交互分離によるデータの離散因子と連続因子の学習』

Michael I Jordan, Zoubin Ghahramani, Tommi S Jaakkola, and Lawrence K Saul. An introduction to variational methods for graphical models. Machine learning, 37(2):183–233, 1999. (Cited on page 32.)
『グラフィカルモデルのための変分法入門』

George Em Karniadakis, Ioannis G Kevrekidis, Lu Lu, Paris Perdikaris, Sifan Wang, and Liu Yang. Physics-informed machine learning. Nature Reviews Physics, 3(6):422–440, 2021. (Cited on page 76.)
『物理学に基づく機械学習』

Koray Kavukcuoglu, Marc’Aurelio Ranzato, and Yann LeCun. Fast inference in sparse coding algorithms with applications to object recognition. arXiv preprint arXiv:1010.3467, 2010. (Cited on pages 34 and 35.)
『スパース符号化アルゴリズムにおける高速推論と物体認識への応用』

E James Kehoe. A layered network model of associative learning: learning to learn and configuration. Psychological review, 95(4):411, 1988. (Cited on page 36.)
『連合学習の階層型ネットワークモデル：学習の学習と構成』

Elias B. Khalil, Hanjun Dai, Yuyu Zhang, Bistra Dilkina, and Le Song. Learning combinatorial optimization algorithms over graphs. In NeurIPS, pages 6348–6358, 2017. (Cited on page 76.)
『グラフ上の組み合わせ最適化アルゴリズムの学習』

Elias Boutros Khalil, Pierre Le Bodic, Le Song, George L. Nemhauser, and Bistra Dilkina. Learning to branch in mixed integer programming. In AAAI, pages 724–731, 2016. (Cited on page 76.)
『混合整数計画における分岐学習』

Mikhail Khodak, Nina Balcan, Ameet Talwalkar, and Sergei Vassilvitskii. Learning predictions for algorithms with predictions. In NeurIPS, 2022. (Cited on pages 46, 69, and 76.)
『予測を使用してアルゴリズムの予測を学習する』

Yoon Kim, Sam Wiseman, Andrew C. Miller, David A. Sontag, and Alexander M. Rush. Semi-amortized variational autoencoders. In ICML, volume 80, pages 2683–2692, 2018. (Cited on pages 8, 9, 11, and 34.)
『半償却変分オートエンコーダ』

Yoon H Kim. Deep latent variable models of natural language. PhD thesis, Harvard University, 2020. (Cited on pages 32 and 75.)
『自然言語の深層潜在変数モデル』(博士論文)

Diederik P. Kingma and Jimmy Ba. Adam: A method for stochastic optimization. In ICLR, 2015. (Cited on pages 14, 29, and 63.)
『確率的最適化のための手法』

Diederik P. Kingma and Max Welling. Auto-encoding variational bayes. In ICLR, 2014. (Cited on pages 7, 32, 33, 34, and 61.)
『自動符号化変分ベイズ法』

Diederik P Kingma, Max Welling, et al. An introduction to variational autoencoders. Foundations and Trends® in Machine Learning, 12(4):307–392, 2019. (Cited on page 32.)
『変分オートエンコーダ入門』

Donald E Kirk. Optimal control theory: an introduction. Courier Corporation, 2004. (Cited on page 50.)
『最適制御理論入門』

Michael Klamkin, Mathieu Tanneau, and Pascal Van Hentenryck. Dual interior point optimization learning, 2025. URL https://arxiv.org/abs/2402.02596. (Cited on page 24.)
『双対内点最適化学習』

Diethard Klatte and Bernd Kummer. Nonsmooth equations in optimization: regularity, calculus, methods and applications, volume 60. Springer Science & Business Media, 2006. (Cited on pages 2 and 30.)
『最適化における非滑らかな方程式：正則性、計算、手法、応用』

Boris Knyazev, Michal Drozdzal, Graham W. Taylor, and Adriana Romero-Soriano. Parameter prediction for unseen deep architectures. In NeurIPS, pages 29433–29448, 2021. (Cited on page 40.)
『目に見えない深いアーキテクチャのパラメータ予測』

Vijay Konda and John Tsitsiklis. Actor-critic algorithms. NeurIPS, 12, 1999. (Cited on page 57.)
『アクター・クリティック・アルゴリズム』

Alexander Korotin, Vage Egiazarian, Arip Asadulaev, Alexander Safin, and Evgeny Burnaev. Wasserstein-2 generative networks. In ICLR, 2021. (Cited on page 48.)
『 Wasserstein-2型生成ネットワーク』

James Kotary, Ferdinando Fioretto, Pascal Van Hentenryck, and Bryan Wilder. End-to-end constrained optimization learning: A survey. ArXiv preprint, abs/2103.16378, 2021. (Cited on page 76.)
『エンドツーエンド制約付き最適化学習：概観』

Nikola Kovachki, Samuel Lanthaler, and Siddhartha Mishra. Journal of Machine Learning Research, 22:Art–No, 2021. (Cited on page 76.)
『機械学習研究ジャーナル』

Tamás Kriváchy, Yu Cai, Joseph Bowles, Daniel Cavalcanti, and Nicolas Brunner. Fast semidefinite programming with feedforward neural networks. ArXiv preprint, abs/2011.05785, 2020. (Cited on page 24.)
『フィードフォワードニューラルネットワークを用いた高速半正定値計画法』

L’ubor Ladicky`, SoHyeon Jeong, Barbara Solenthaler, Marc Pollefeys, and Markus Gross. Data-driven fluid simulations using regression forests. ACM Transactions on Graphics (TOG), 34(6): 1–9, 2015. (Cited on page 76.)
『回帰フォレストを用いたデータ駆動型流体シミュレーション』

Brenden M Lake, Tomer D Ullman, Joshua B Tenenbaum, and Samuel J Gershman. Building machines that learn and think like people. Behavioral and brain sciences, 40, 2017. (Cited on page 36.)
『人間のように学習し、考える機械の構築』

Nathan Lambert, Brandon Amos, Omry Yadan, and Roberto Calandra. Objective mismatch in model-based reinforcement learning. ArXiv preprint, abs/2002.04523, 2020. (Cited on page 56.)
『モデルベース強化学習における目的不一致』

Guillaume Lample and François Charton. Deep learning for symbolic mathematics. In ICLR, 2020. (Cited on page 76.)
『記号数学のためのディープラーニング』

Hoang Minh Le, Cameron Voloshin, and Yisong Yue. Batch policy learning under constraints. In ICML, volume 97, pages 3703–3712, 2019. (Cited on page 58.)
『制約条件下におけるバッチポリシー学習』

Yann LeCun. The mnist database of handwritten digits. http://yann. lecun. com/exdb/mnist/, 1998. (Cited on page 61.)
『手書き数字のmnistデータベース』

Juho Lee, Yoonho Lee, Jungtaek Kim, Adam R. Kosiorek, Seungjin Choi, and Yee Whye Teh. Set transformer: A framework for attention-based permutation-invariant neural networks. In ICML, volume 97, pages 3744–3753, 2019a. (Cited on page 75.)
『セットトランスフォーマー: 注意ベースの順列不変ニューラルネットワークのフレームワーク』

Kwonjoon Lee, Subhransu Maji, Avinash Ravichandran, and Stefano Soatto. Meta-learning with differentiable convex optimization. In CVPR, pages 10657–10665. Computer Vision Foundation / IEEE, 2019b. doi: 10.1109/CVPR.2019.01091. (Cited on pages 39 and 73.)
『微分可能凸最適化を用いたメタ学習.』

Sergey Levine and Pieter Abbeel. Learning neural network policies with guided policy search under unknown dynamics. In NeurIPS, pages 1071–1079, 2014. (Cited on page 55.)
『未知のダイナミクス下における誘導ポリシー探索を用いたニューラルネットワークポリシーの学習』

Sergey Levine and Vladlen Koltun. Guided policy search. In ICML, volume 28, pages 1–9, 2013. (Cited on pages 21, 37, 51, and 55.)
『ガイド付きポリシー検索』

Sergey Levine, Chelsea Finn, Trevor Darrell, and Pieter Abbeel. The Journal of Machine Learning Research, 17(1):1334–1373, 2016. (Cited on page 55.)
『機械学習研究ジャーナル』

Ke Li and Jitendra Malik. Learning to optimize. In ICLR, 2017a. (Cited on pages 10, 21, 36, and 37.)
『最適化を学ぶ』

Ke Li and Jitendra Malik. Learning to optimize neural nets. ArXiv preprint, abs/1703.00441, 2017b. (Cited on pages 10, 21, 36, and 37.)
『ニューラルネットワークの最適化学習』

Zongyi Li, Nikola Borislavov Kovachki, Kamyar Azizzadenesheli, Burigede Liu, Kaushik Bhat-tacharya, Andrew M. Stuart, and Anima Anandkumar. Fourier neural operator for parametric partial differential equations. In ICLR, 2021a. (Cited on page 76.)
『パラメトリック偏微分方程式のためのフーリエニューラル演算子』

Zongyi Li, Hongkai Zheng, Nikola Kovachki, David Jin, Haoxuan Chen, Burigede Liu, Kamyar Azizzadenesheli, and Anima Anandkumar. Physics-informed neural operator for learning partial differential equations. ArXiv preprint, abs/2111.03794, 2021b. (Cited on page 17.)
『偏微分方程式を学習するための物理学に基づくニューラル演算子』

Renjie Liao, Yuwen Xiong, Ethan Fetaya, Lisa Zhang, KiJung Yoon, Xaq Pitkow, Raquel Urtasun, and Richard S. Zemel. Reviving and improving recurrent back-propagation. In ICML, volume 80, pages 3088–3097, 2018. (Cited on page 19.)
『リカレントバックプロパゲーションの復活と改良』

Timothy P. Lillicrap, Jonathan J. Hunt, Alexander Pritzel, Nicolas Heess, Tom Erez, Yuval Tassa, David Silver, and Daan Wierstra. Continuous control with deep reinforcement learning. In ICLR, 2016. (Cited on page 53.)
『深層強化学習による連続制御』

Xinran Liu, Yuzhe Lu, Ali Abbasi, Meiyi Li, Javad Mohammadi, and Soheil Kolouri. Teaching networks to solve optimization problems, 2022. (Cited on pages 16 and 75.)
『最適化問題を解くためのネットワークの指導』

Andrea Lodi and Giulia Zarpellon. On learning and branching: a survey. Top, 25(2):207–236, 2017. (Cited on page 76.)
『学習と分岐について：概説』

Jonathan Long, Evan Shelhamer, and Trevor Darrell. Fully convolutional networks for semantic segmentation. In CVPR, 2015. (Cited on page 13.)
『セマンティックセグメンテーションのための完全畳み込みネットワーク』

Jonathan Lorraine, Paul Vicol, and David Duvenaud. Optimizing millions of hyperparameters by implicit differentiation. In AISTATS, volume 108, pages 1540–1552, 2020. (Cited on pages 12 and 19.)
『暗黙的微分化による数百万のハイパーパラメータの最適化』

Kendall Lowrey, Aravind Rajeswaran, Sham M. Kakade, Emanuel Todorov, and Igor Mordatch. Plan online, learn ofline: Eficient learning and exploration via model-based control. In ICLR, 2019. (Cited on page 49.)
『オンラインで計画し、オフラインで学ぶ：モデルベース制御による効率的な学習と探索』

Renqian Luo, Fei Tian, Tao Qin, Enhong Chen, and Tie-Yan Liu. Neural architecture optimization. In NeurIPS, pages 7827–7838, 2018. (Cited on pages 10 and 76.)
『ニューラルアーキテクチャの最適化』

Kaifeng Lv, Shunhua Jiang, and Jian Li. Learning gradient descent: Better generalization and longer horizons. In ICML, volume 70, pages 2247–2255, 2017. (Cited on page 36.)
『勾配降下法の学習：より優れた一般化とより長いホライズン』

Dougal Maclaurin. Modeling, inference and optimization with composable differentiable procedures. PhD thesis, Harvard University, 2016. (Cited on page 18.)
『構成可能微分可能手続きによるモデリング、推論、最適化』(博士論文)

Dougal Maclaurin, David Duvenaud, and Ryan P Adams. Autograd: Effortless gradients in numpy. In ICML 2015 AutoML workshop, volume 238, page 5, 2015a. (Cited on page 60.)
『Autograd: NumPyにおける簡単な勾配計算』

Dougal Maclaurin, David Duvenaud, and Ryan P. Adams. Gradient-based hyperparameter opti-mization through reversible learning. In ICML, volume 37, pages 2113–2122, 2015b. (Cited on pages 18 and 19.)
『Adams. 可逆学習による勾配ベースハイパーパラメータ最適化』

Niru Maheswaranathan, David Sussillo, Luke Metz, Ruoxi Sun, and Jascha Sohl-Dickstein. Reverse engineering learned optimizers reveals known and novel mechanisms. In NeurIPS, pages 19910– 19922, 2021. (Cited on page 28.)
『学習したオプティマイザーをリバースエンジニアリングすると、既知のメカニズムと新しいメカニズムが明らかになる』

Odalric-Ambrym Maillard, Rémi Munos, Alessandro Lazaric, and Mohammad Ghavamzadeh. Finite-sample analysis of bellman residual minimization. In 2nd Asian Conference on Machine Learning, pages 299–314. JMLR Workshop and Conference Proceedings, 2010. (Cited on page 58.)
『有限サンプルを用いたベルマン残差最小化の解析』

Ashok Vardhan Makkuva, Amirhossein Taghvaei, Sewoong Oh, and Jason D. Lee. Optimal transport mapping via input convex neural networks. In ICML, volume 119, pages 6672–6681, 2020. (Cited on page 48.)
『入力凸ニューラルネットワークによる最適輸送マッピング』

Joseph Marino, Milan Cvitkovic, and Yisong Yue. A general method for amortizing variational filtering. In NeurIPS, pages 7868–7879, 2018a. (Cited on page 5.)
『変分フィルタリングを償却するための一般的な方法』

Joseph Marino, Yisong Yue, and Stephan Mandt. Iterative amortized inference. In ICML, volume 80, pages 3400–3409, 2018b. (Cited on pages 8 and 34.)
『反復償却推論』

Joseph Marino, Alexandre Piché, Alessandro Davide Ialongo, and Yisong Yue. Iterative amortized policy optimization. In NeurIPS, pages 15667–15681, 2021. (Cited on pages 57 and 74.)
『反復償却方策最適化』

Joseph Louis Marino. Learned Feedback & Feedforward Perception & Control. PhD thesis, California Institute of Technology, 2021. (Cited on pages 7, 32, and 75.)
『学習フィードバックとフィードフォワード知覚と制御』(博士論文)

Tanya Marwah, Zachary C. Lipton, and Andrej Risteski. Parametric complexity bounds for approximating pdes with neural networks. In NeurIPS, pages 15044–15055, 2021. (Cited on page 76.)
『ニューラルネットワークによる偏微分方程式の近似におけるパラメトリック複雑度境界』

Tim Meinhardt, Michael Möller, Caner Hazirbas, and Daniel Cremers. Learning proximal operators: Using denoising networks for regularizing inverse imaging problems. In ICCV, pages 1799–1808, 2017. (Cited on page 74.)
『近接演算子の学習：ノイズ除去ネットワークを用いた逆画像問題の正規化』

Gonzalo E. Mena, David Belanger, Scott W. Linderman, and Jasper Snoek. Learning latent permutations with gumbel-sinkhorn networks. In ICLR, 2018. (Cited on page 27.)
『ガンベル・シンクホーンネットワークを用いた潜在順列の学習』

Amil Merchant, Luke Metz, Samuel S. Schoenholz, and Ekin D. Cubuk. Learn2hop: Learned optimization on rough landscapes. In ICML, volume 139, pages 7643–7653, 2021. (Cited on pages 22, 40, and 72.)
『粗い地形における学習最適化』

Luke Metz, Ben Poole, David Pfau, and Jascha Sohl-Dickstein. Unrolled generative adversarial networks. In ICLR, 2017. (Cited on page 18.)
『展開された敵対的生成ネットワーク』

Luke Metz, Niru Maheswaranathan, Jeremy Nixon, C. Daniel Freeman, and Jascha Sohl-Dickstein. Understanding and correcting pathologies in the training of learned optimizers. In ICML, volume 97, pages 4556–4565, 2019a. (Cited on pages 21, 22, 39, 40, and 72.)
『学習済み最適化アルゴリズムの訓練における病理の理解と修正』

Luke Metz, Niru Maheswaranathan, Jonathon Shlens, Jascha Sohl-Dickstein, and Ekin D Cubuk. Using learned optimizers to make models robust to input noise. ArXiv preprint, abs/1906.03367, 2019b. (Cited on page 39.)
『学習済み最適化器を用いて入力ノイズに対して堅牢なモデルを構築する』

Luke Metz, C Daniel Freeman, Samuel S Schoenholz, and Tal Kachman. Gradients are not all you need. ArXiv preprint, abs/2111.05803, 2021. (Cited on pages 39, 69, and 71.)
『勾配だけが必要なわけではない』

Luke Metz, James Harrison, C Daniel Freeman, Amil Merchant, Lucas Beyer, James Bradbury, Naman Agrawal, Ben Poole, Igor Mordatch, Adam Roberts, et al. Velo: Training versatile learned optimizers by scaling up. ArXiv preprint, abs/2211.09760, 2022. (Cited on pages 13 and 40.)
『スケールアップによる汎用学習済み最適化アルゴリズムのトレーニング』

Paul Milgrom and Ilya Segal. Envelope theorems for arbitrary choice sets. Econometrica, 70(2): 583–601, 2002. (Cited on page 30.)
『任意選択集合の包絡定理』

Sidhant Misra, Line Roald, and Yeesian Ng. Learning for constrained optimization: Identifying optimal active constraint sets. INFORMS Journal on Computing, 2021. (Cited on page 24.)
『制約付き最適化のための学習：最適なアクティブ制約セットの特定』

Andriy Mnih and Karol Gregor. Neural variational inference and learning in belief networks. In ICML, volume 32, pages 1791–1799, 2014. (Cited on page 32.)
『信念ネットワークにおけるニューラル変分推論と学習』

Shakir Mohamed, Mihaela Rosca, Michael Figurnov, and Andriy Mnih. Monte carlo gradient estimation in machine learning. J. Mach. Learn. Res., 21(132):1–62, 2020. (Cited on page 54.)
『機械学習におけるモンテカルロ勾配推定』

Vishal Monga, Yuelong Li, and Yonina C Eldar. Algorithm unrolling: Interpretable, eficient deep learning for signal and image processing. IEEE Signal Processing Magazine, 38(2):18–44, 2021. (Cited on pages 18 and 75.)
『アルゴリズムアンローリング：信号処理と画像処理のための解釈可能で効率的なディープラーニング』

William H. Montgomery and Sergey Levine. Guided policy search via approximate mirror descent. In NeurIPS, pages 4008–4016, 2016. (Cited on page 55.)
『近似ミラー降下法による誘導方策探索』

Kevin P Murphy. Machine learning: a probabilistic perspective. MIT press, 2012. (Cited on page 3.)
『機械学習：確率論的視点』

Yurii Nesterov. A method for unconstrained convex minimization problem with the rate of con-vergence o (1/kˆ 2). In Doklady an ussr, volume 269, pages 543–547, 1983. (Cited on pages 14 and 28.)
『収束速度がo(1/kˆ2)である制約なし凸最小化問題に対する一手法』

Yurii Nesterov et al. Lectures on convex optimization, volume 137. Springer, 2018. (Cited on page 3.)
『凸最適化に関する講義』

Khai Nguyen and Nhat Ho. Amortized projection optimization for sliced wasserstein generative models. ArXiv preprint, abs/2203.13417, 2022. (Cited on page 48.)
『スライスされたワッサースタイン生成モデルのための償却射影最適化』

Alex Nichol, Joshua Achiam, and John Schulman. On first-order meta-learning algorithms. ArXiv preprint, abs/1803.02999, 2018. (Cited on pages 11, 12, and 19.)
『一次メタ学習アルゴリズムについて』

Jorge Nocedal and Stephen Wright. Numerical optimization. Springer Science & Business Media, 2006. (Cited on page 3.)
『数値最適化』

Bruno A Olshausen and David J Field. Emergence of simple-cell receptive field properties by learning a sparse code for natural images. Nature, 381(6583):607–609, 1996. (Cited on page 35.)
『自然画像のためのスパースコードの学習による単純細胞受容野特性の発現』

Takayuki Osa, Joni Pajarinen, Gerhard Neumann, J Andrew Bagnell, Pieter Abbeel, Jan Peters, et al. An algorithmic perspective on imitation learning. Foundations and Trends® in Robotics, 7 (1-2):1–179, 2018. (Cited on page 52.)
『模倣学習におけるアルゴリズム的視点』

Brendan O’donoghue, Eric Chu, Neal Parikh, and Stephen Boyd. Conic optimization via operator splitting and homogeneous self-dual embedding. Journal of Optimization Theory and Applications, 169(3):1042–1068, 2016. (Cited on pages 9, 42, and 73.)
『演算子分割と同次自己双対埋め込みによる円錐最適化』

Xiang Pan, Minghua Chen, Tianyu Zhao, and Steven H Low. Deepopf: A feasibility-optimized deep neural network approach for ac optimal power flow problems. ArXiv preprint, abs/2007.01002, 2020. (Cited on page 24.)
『交流最適電力潮流問題のための実現可能性最適化ディープニューラルネットワークアプローチ』

Neal Parikh and Stephen Boyd. Proximal algorithms. Foundations and Trends in optimization, 1 (3):127–239, 2014. (Cited on page 27.)
『近似アルゴリズム』

Paavo Parmas and Masashi Sugiyama. A unified view of likelihood ratio and reparameterization gradients. In AISTATS, volume 130, pages 4078–4086, 2021. (Cited on page 40.)
『尤度比と再パラメータ化勾配の統一的視点』

Paavo Parmas, Carl Edward Rasmussen, Jan Peters, and Kenji Doya. PIPPS: flexible model-based policy search robust to the curse of chaos. In ICML, volume 80, pages 4062–4071, 2018. (Cited on pages 18 and 39.)
『カオスの呪いに頑健な柔軟なモデルベース方策探索』

Razvan Pascanu, Tomás Mikolov, and Yoshua Bengio. On the dificulty of training recurrent neural networks. In ICML, volume 28, pages 1310–1318, 2013. (Cited on page 18.)
『リカレントニューラルネットワークの学習の難しさについて』

Adam Paszke, Sam Gross, Francisco Massa, Adam Lerer, James Bradbury, Gregory Chanan, Trevor Killeen, Zeming Lin, Natalia Gimelshein, Luca Antiga, Alban Desmaison, Andreas Köpf, Edward Yang, Zachary DeVito, Martin Raison, Alykhan Tejani, Sasank Chilamkurthy, Benoit Steiner, Lu Fang, Junjie Bai, and Soumith Chintala. Pytorch: An imperative style, high-performance deep learning library. In NeurIPS, pages 8024–8035, 2019. (Cited on page 60.)
『Pytorch: 命令型スタイルの高性能ディープラーニングライブラリ』

Barak A Pearlmutter. Fast exact multiplication by the hessian. Neural computation, 6(1):147–160, 1994. (Cited on page 11.)
『ヘッセ行列による高速かつ正確な乗算』

Barak A Pearlmutter. An investigation of the gradient descent process in neural networks. PhD thesis, Carnegie Mellon University, 1996. (Cited on page 18.)
『ニューラルネットワークにおける勾配降下法の検討』

Barak A Pearlmutter and Jeffrey Mark Siskind. Reverse-mode ad in a functional framework: Lambda the ultimate backpropagator. ACM Transactions on Programming Languages and Systems (TOPLAS), 30(2):1–36, 2008. (Cited on page 18.)
『関数型フレームワークにおける逆モード広告：究極のバックプロパゲーター、ラムダ』

Xavier Pennec. Intrinsic statistics on riemannian manifolds: Basic tools for geometric measurements. Journal of Mathematical Imaging and Vision, 25(1):127–154, 2006. (Cited on page 23.)
『リーマン多様体における固有統計：幾何学的測定のための基本ツール』

Gabriel Peyré, Marco Cuturi, et al. Computational optimal transport: With applications to data science. Foundations and Trends® in Machine Learning, 11(5-6):355–607, 2019. (Cited on page 45.)
『計算最適輸送』

Michael Poli, Stefano Massaroli, Atsushi Yamashita, Hajime Asama, and Jinkyoo Park. Hypersolvers: Toward fast continuous-depth models. In NeurIPS, 2020. (Cited on page 76.)
『ハイパーソルバー：高速連続深度モデルの構築に向けて』

Isabeau Prémont-Schwarz, Jaroslav Vitku, and Jan Feyereisl. A simple guard for learned optimizers. In ICML, volume 162, pages 17910–17925, 2022. (Cited on page 70.)
『学習されたオプティマイザーの単純なガード』

Aniruddh Raghu, Maithra Raghu, Samy Bengio, and Oriol Vinyals. Rapid learning or feature reuse? towards understanding the effectiveness of MAML. In ICLR, 2020. (Cited on page 39.)
『高速学習か特徴再利用か？ MAMLの有効性の理解に向けて』

Aravind Rajeswaran, Chelsea Finn, Sham M. Kakade, and Sergey Levine. Meta-learning with implicit gradients. In NeurIPS, pages 113–124, 2019. (Cited on pages 19, 20, and 73.)
『暗黙的勾配を用いたメタ学習』

Sachin Ravi and Alex Beatson. Amortized bayesian meta-learning. In ICLR, 2019. (Cited on pages 7 and 29.)
『償却ベイズメタ学習』

Sachin Ravi and Hugo Larochelle. Optimization as a model for few-shot learning. In ICLR, 2017. (Cited on pages 10, 12, 38, and 70.)
『最適化をFew-Shot Learningのモデルとして用いる』

Esteban Real, Chen Liang, David R. So, and Quoc V. Le. Automl-zero: Evolving machine learning algorithms from scratch. In ICML, volume 119, pages 8007–8019, 2020. (Cited on page 28.)
『機械学習アルゴリズムをゼロから進化させる』

Danilo Jimenez Rezende and Shakir Mohamed. Variational inference with normalizing flows. In ICML, volume 37, pages 1530–1538, 2015. (Cited on pages 32 and 34.)
『正規化フローを用いた変分推論』

Danilo Jimenez Rezende and Fabio Viola. Taming vaes. ArXiv preprint, abs/1810.00597, 2018. (Cited on page 73.)
『Taming VAEs』

Danilo Jimenez Rezende, Shakir Mohamed, and Daan Wierstra. Stochastic backpropagation and approximate inference in deep generative models. In ICML, volume 32, pages 1278–1286, 2014. (Cited on pages 7 and 32.)
『深層生成モデルにおける確率的バックプロパゲーションと近似推論』

Stephen L Richter and Raymond A Decarlo. Continuation methods: Theory and applications. IEEE Transactions on Systems, Man, and Cybernetics, SMC-13(4):459–464, 1983. (Cited on page 76.)
『継続法：理論と応用』

Olaf Ronneberger, Philipp Fischer, and Thomas Brox. U-net: Convolutional networks for biomedical image segmentation. In International Conference on Medical image computing and computer-assisted intervention, pages 234–241. Springer, 2015. (Cited on page 13.)
『U-net: バイオメディカル画像セグメンテーションのための畳み込みネットワーク』

Sebastian Ruder. An overview of multi-task learning in deep neural networks. ArXiv preprint, abs/1706.05098, 2017. (Cited on page 36.)
『ディープニューラルネットワークにおけるマルチタスク学習の概要』

Thomas Philip Runarsson and Magnus Thor Jonsson. Evolution and design of distributed learning rules. In 2000 IEEE Symposium on Combinations of Evolutionary Computation and Neural Net-works. Proceedings of the First IEEE Symposium on Combinations of Evolutionary Computation and Neural Networks (Cat. No. 00, pages 59–63. IEEE, 2000. (Cited on page 28.)
『分散学習ルールの進化と設計』

Olga Russakovsky, Jia Deng, Hao Su, Jonathan Krause, Sanjeev Satheesh, Sean Ma, Zhiheng Huang, Andrej Karpathy, Aditya Khosla, Michael Bernstein, et al. Imagenet large scale visual recognition challenge. International journal of computer vision, 115(3):211–252, 2015. (Cited on page 39.)
『Imagenet の大規模視覚認識チャレンジ』

Andrei A. Rusu, Dushyant Rao, Jakub Sygnowski, Oriol Vinyals, Razvan Pascanu, Simon Osindero, and Raia Hadsell. Meta-learning with latent embedding optimization. In ICLR, 2019. (Cited on page 38.)
『潜在的埋め込み最適化を用いたメタ学習』

Moonkyung Ryu, Yinlam Chow, Ross Anderson, Christian Tjandraatmadja, and Craig Boutilier. CAQL: continuous action q-learning. In ICLR, 2020. (Cited on page 49.)
『CAQL:連続行動Q学習』

Jacob Sacks and Byron Boots. Learning to optimize in model predictive control. In ICRA, pages 10549–10556. IEEE, 2022. (Cited on page 55.)
『モデル予測制御における最適化学習』

Shinsaku Sakaue and Taihei Oki. Discrete-convex-analysis-based framework for warm-starting algorithms with predictions. In NeurIPS, 2022. (Cited on page 76.)
『離散凸解析に基づく予測付きウォームスターティングアルゴリズムの枠組み』

Ruslan Salakhutdinov. Deep learning. In KDD, page 1973. ACM, 2014. doi: 10.1145/2623330.2630809. (Cited on page 3.)
『ディープラーニング』

Tim Salimans and Jonathan Ho. Progressive distillation for fast sampling of diffusion models. In ICLR, 2022. (Cited on page 76.)
『拡散モデルの高速サンプリングのための漸進的蒸留法』

Rajiv Sambharya, Georgina Hall, Brandon Amos, and Bartolomeo Stellato. End-to-end learning to warm-start for real-time quadratic optimization, 2022. URL https://arxiv.org/abs/2212.08260. (Cited on page 70.)
『リアルタイム二次最適化のためのウォームスタートへのエンドツーエンド学習』

Rajiv Sambharya, Georgina Hall, Brandon Amos, and Bartolomeo Stellato. Learning to warm-start fixed-point optimization algorithms, 2023. URL https://arxiv.org/abs/2309.07835. (Cited on page 70.)
『ウォームスタート固定小数点最適化アルゴリズムの学習』

Alvaro Sanchez-Gonzalez, Jonathan Godwin, Tobias Pfaff, Rex Ying, Jure Leskovec, and Peter W. Battaglia. Learning to simulate complex physics with graph networks. In ICML, volume 119, pages 8459–8468, 2020. (Cited on page 76.)
『グラフネットワークを用いた複雑な物理シミュレーションの学習』

Filippo Santambrogio. Optimal transport for applied mathematicians. Birkäuser, NY, 55(58-63):94, 2015. (Cited on page 45.)
『応用数学者のための最適輸送』

Bruno Scherrer. Should one compute the temporal difference fix point or minimize the bellman residual? the unified oblique projection view. In ICML, pages 959–966, 2010. (Cited on page 58.)
『時間差不動点を計算するべきか、それともベルマン残差を最小化すべきか？統一斜投影図法の観点から』

Jürgen Schmidhuber. Evolutionary principles in self-referential learning, or on learning how to learn: the meta-meta-... hook. PhD thesis, Technische Universität München, 1987. (Cited on page 36.)
『自己参照的学習における進化原理、あるいは学習方法の学習：メタメタフック』

Jürgen Schmidhuber. On learning how to learn learning strategies. Technical report, TU Munchen, 1995. (Cited on page 36.)
『学習戦略の学習方法について』

Avi Schwarzschild, Eitan Borgnia, Arjun Gupta, Furong Huang, Uzi Vishkin, Micah Goldblum, and Tom Goldstein. Can you learn an algorithm? generalizing from easy to hard problems with recurrent networks. In NeurIPS, pages 6695–6706, 2021. (Cited on page 76.)
『アルゴリズムは学習できるか？リカレントネットワークを用いた簡単な問題から難しい問題への一般化』

Tom Sercu, Robert Verkuil, Joshua Meier, Brandon Amos, Zeming Lin, Caroline Chen, Jason Liu, Yann LeCun, and Alexander Rives. Neural potts model. bioRxiv, 2021. (Cited on pages 7 and 38.)
『Neural Pottsモデル』

Amirreza Shaban, Ching-An Cheng, Nathan Hatch, and Byron Boots. Truncated back-propagation for bilevel optimization. In AISTATS, volume 89, pages 1723–1732, 2019. (Cited on page 19.)
『二層最適化のための切り捨てバックプロパゲーション』

Zhihui Shao, Jianyi Yang, Cong Shen, and Shaolei Ren. Learning for robust combinatorial optimiza-tion: Algorithm and application. ArXiv preprint, abs/2112.10377, 2021. (Cited on page 76.)
『ロバストな組み合わせ最適化のための学習：アルゴリズムと応用』

Alexander Shapiro. Sensitivity analysis of generalized equations. Journal of Mathematical Sciences, 115(4), 2003. (Cited on pages 2 and 30.)
『一般化方程式の感度解析』

Arsalan Sharifnassab, Saber Salehkaleybar, and Richard Sutton. Metaoptimize: A framework for optimizing step sizes and other meta-parameters, 2024. URL https://arxiv.org/abs/2402. 02342. (Cited on page 40.)
『Metaoptimize: ステップサイズやその他のメタパラメータを最適化するためのフレームワーク』

Rui Shu. Amortized Optimization, 2017. Accessed: 2020-02-02. (Cited on pages 6, 36, and 74.)
『償却最適化』

David Silver, Guy Lever, Nicolas Heess, Thomas Degris, Daan Wierstra, and Martin A. Riedmiller. Deterministic policy gradient algorithms. In ICML, volume 32, pages 387–395, 2014. (Cited on page 53.)
『決定論的方策勾配アルゴリズム』

David Silver, Anirudh Goyal, Ivo Danihelka, Matteo Hessel, and Hado van Hasselt. Learning by directional gradient descent. In ICLR, 2022. (Cited on page 19.)
『方向性勾配降下法による学習』

Jens Sjölund. A tutorial on parametric variational inference. ArXiv preprint, abs/2301.01236, 2023. (Cited on page 32.)
『パラメトリック変分推論のチュートリアル』

Jens Sjölund and Maria Bånkestad. Graph-based neural acceleration for nonnegative matrix factorization, 2022. (Cited on page 43.)
『非負値行列分解のためのグラフベースニューラル加速』

Alexander J. Smola, S. V. N. Vishwanathan, and Quoc V. Le. Bundle methods for machine learning. In NeurIPS, pages 1377–1384. Curran Associates, Inc., 2007. (Cited on page 10.)
『機械学習のためのバンドル手法』

Casper Kaae Sønderby, Tapani Raiko, Lars Maaløe, Søren Kaae Sønderby, and Ole Winther. Ladder variational autoencoders. In NeurIPS, pages 3738–3746, 2016. (Cited on page 34.)
『ラダー変分オートエンコーダ』

Kenneth O Stanley, David B D’Ambrosio, and Jason Gauci. A hypercube-based encoding for evolving large-scale neural networks. Artificial life, 15(2):185–212, 2009. (Cited on page 36.)
『大規模ニューラルネットワークの進化のためのハイパーキューブベースの符号化』

Bartolomeo Stellato, Goran Banjac, Paul Goulart, Alberto Bemporad, and Stephen Boyd. Osqp: An operator splitting solver for quadratic programs. In UKACC 12th international conference on control (CONTROL), pages 339–339. IEEE, 2018. (Cited on pages 9, 44, and 73.)
『Osqp: 二次計画問題のための演算子分割ソルバー』

Georg Still. Lectures on parametric optimization: An introduction. Optimization Online, 2018. (Cited on pages 2 and 30.)
『パラメトリック最適化の講義：入門』

Andreas Stuhlmüller, Jessica Taylor, and Noah D. Goodman. Learning stochastic inverses. In NeurIPS, pages 3048–3056, 2013. (Cited on page 7.)
『確率的逆行列の学習』

Michael Sucker and Peter Ochs. A generalization result for convergence in learning-to-optimize. arXiv preprint arXiv:2410.07704, 2024. (Cited on page 70.)
『最適化学習における収束の一般化結果』

Richard S Sutton and Andrew G Barto. Reinforcement learning: An introduction. MIT press, 2018. (Cited on pages 5, 57, and 58.)
『強化学習：入門』

Kevin Swersky, Yulia Rubanova, David Dohan, and Kevin Murphy. Amortized bayesian optimization over discrete spaces. In UAI, volume 124, 2020. (Cited on page 29.)
『離散空間における償却ベイズ最適化』

Christian Szegedy, Vincent Vanhoucke, Sergey Ioffe, Jonathon Shlens, and Zbigniew Wojna. Re-thinking the inception architecture for computer vision. In CVPR, 2016. (Cited on page 39.)
『コンピュータビジョンにおけるインセプションアーキテクチャの再考』

Amirhossein Taghvaei and Amin Jalali. 2-wasserstein approximation via restricted convex potentials with application to improved training for gans. ArXiv preprint, abs/1902.07197, 2019. (Cited on page 47.)
『制限付き凸ポテンシャルによる2-ワッサーシュタイン近似とGANSの学習改善への応用』

Corentin Tallec and Yann Ollivier. Unbiasing truncated backpropagation through time. ArXiv preprint, abs/1705.08209, 2017. (Cited on page 19.)
『時間経過に伴う不偏性除去のための切断バックプロパゲーション』

Corentin Tallec and Yann Ollivier. Unbiased online recurrent optimization. In ICLR, 2018. (Cited on page 19.)
『偏りのないオンライン再帰最適化』

Guy Tennenholtz and Shie Mannor. The natural language of actions. In ICML, volume 97, pages 6196–6205, 2019. (Cited on page 76.)
『行動の自然言語』

James Thornton and Marco Cuturi. Rethinking initialization of the sinkhorn algorithm. ArXiv preprint, abs/2206.07630, 2022. (Cited on page 46.)
『シンクホーンアルゴリズムの初期化の再考』

Sebastian Thrun and Lorien Pratt. Learning to learn: Introduction and overview. In Learning to learn, pages 3–17. Springer, 1998. (Cited on page 36.)
『学ぶことを学ぶ：序論と概要』

Ali Usman, Muhammad Rafiq, Muhammad Saeed, Ali Nauman, Andreas Almqvist, and Marcus Liwicki. Machine learning computational fluid dynamics. In 2021 Swedish Artificial Intelligence Society Workshop (SAIS), pages 1–4. IEEE, 2021. (Cited on page 76.)
『機械学習による数値流体力学』

Tom Van de Wiele, David Warde-Farley, Andriy Mnih, and Volodymyr Mnih. Q-learning in enormous action spaces via amortized approximate maximization. ArXiv preprint, abs/2001.08116, 2020. (Cited on page 76.)
『償却近似最大化による巨大行動空間におけるQ学習』

Ashish Vaswani, Noam Shazeer, Niki Parmar, Jakob Uszkoreit, Llion Jones, Aidan N. Gomez, Lukasz Kaiser, and Illia Polosukhin. Attention is all you need. In NeurIPS, pages 5998–6008, 2017. (Cited on page 39.)
『必要なのは注意だけ』

Singanallur V Venkatakrishnan, Charles A Bouman, and Brendt Wohlberg. Plug-and-play priors for model based reconstruction. In IEEE Global Conference on Signal and Information Processing, pages 945–948. IEEE, 2013. (Cited on page 74.)
『モデルベース再構成のためのプラグアンドプレイ事前分布』

Shobha Venkataraman and Brandon Amos. Neural fixed-point acceleration for convex optimization. ArXiv preprint, abs/2107.10254, 2021. (Cited on pages 9, 42, 44, and 73.)
『凸最適化のためのニューラル固定小数点アクセラレーション』

Paul Vicol, Luke Metz, and Jascha Sohl-Dickstein. Unbiased gradient estimation in unrolled computation graphs with persistent evolution strategies. In ICML, volume 139, pages 10553– 10563, 2021. (Cited on page 19.)
『永続的進化戦略を用いた展開計算グラフにおける不偏勾配推定』

Ricardo Vilalta and Youssef Drissi. A perspective view and survey of meta-learning. Artificial intelligence review, 18(2):77–95, 2002. (Cited on page 36.)
『メタ学習の展望と概観』

Cédric Villani. Optimal transport: old and new, volume 338. Springer, 2009. (Cited on pages 45, 46, and 47.)
『最適輸送：新旧』

Ricardo Vinuesa and Steven L Brunton. The potential of machine learning to enhance computational fluid dynamics. ArXiv preprint, abs/2110.02085, 2021. (Cited on page 76.)
『機械学習による数値流体力学の強化の可能性』

Martin J Wainwright and Michael Irwin Jordan. Graphical models, exponential families, and variational inference. Now Publishers Inc, 2008. (Cited on page 32.)
『グラフィカルモデル、指数族、そして変分推論』

Homer F Walker and Peng Ni. Anderson acceleration for fixed-point iterations. SIAM Journal on Numerical Analysis, 49(4):1715–1735, 2011. (Cited on page 41.)
『固定小数点反復法におけるアンダーソン加速』

Haoxiang Wang, Han Zhao, and Bo Li. Bridging multi-task learning and meta-learning: Towards eficient training and effective adaptation. In ICML, volume 139, pages 10991–11002, 2021. (Cited on page 39.)
『マルチタスク学習とメタ学習の橋渡し：効率的な訓練と効果的な適応に向けて』

Tingwu Wang and Jimmy Ba. Exploring model-based planning with policy networks. In ICLR, 2020. (Cited on pages 10, 55, and 56.)
『ポリシーネットワークを用いたモデルベース計画の探究』

Lewis B Ward. Reminiscence and rote learning. Psychological Monographs, 49(4):i, 1937. (Cited on page 36.)
『回想と暗記学習』

Christopher JCH Watkins and Peter Dayan. Q-learning. Machine learning, 8(3-4):279–292, 1992. (Cited on page 58.)
『Q学習』

Layne T Watson and Raphael T Haftka. Modern homotopy methods in optimization. Computer Methods in Applied Mechanics and Engineering, 74(3):289–305, 1989. (Cited on page 76.)
『最適化における現代のホモトピー法. 応用力学・工学におけるコンピュータ手法』

Stefan Webb, Adam Golinski, Robert Zinkov, Siddharth Narayanaswamy, Tom Rainforth, Yee Whye Teh, and Frank Wood. Faithful inversion of generative models for effective amortized inference. In NeurIPS, pages 3074–3084, 2018. (Cited on page 7.)
『効果的な償却推論のための生成モデルの忠実な逆変換』

Lilian Weng. Meta-learning: Learning to learn fast. http://lilianweng.github.io/lil-log, 2018. (Cited on pages 11, 36, and 75.)
『メタ学習：速く学ぶための学習』

Paul J Werbos. Backpropagation through time: what it does and how to do it. Proceedings of the IEEE, 78(10):1550–1560, 1990. (Cited on page 18.)
『時間経過によるバックプロパゲーション：その機能と実行方法』

Olga Wichrowska, Niru Maheswaranathan, Matthew W. Hoffman, Sergio Gomez Colmenarejo, Misha Denil, Nando de Freitas, and Jascha Sohl-Dickstein. Learned optimizers that scale and generalize. In ICML, volume 70, pages 3751–3760, 2017. (Cited on page 39.)
『スケーリングと汎用化を実現する学習されたオプティマイザー』

Steffen Wiewel, Moritz Becher, and Nils Thuerey. Latent space physics: Towards learning the temporal evolution of fluid flow. In Computer graphics forum, volume 38, pages 71–82. Wiley Online Library, 2019. (Cited on page 76.)
『潜在空間物理学：流体の流れの時間的変化の学習に向けて』

Ronald J Williams. Simple statistical gradient-following algorithms for connectionist reinforcement learning. Reinforcement learning, pages 5–32, 1992. (Cited on page 54.)
『コネクショニスト強化学習のための単純な統計的勾配追従アルゴリズム』

Ronald J Williams and David Zipser. A learning algorithm for continually running fully recurrent neural networks. Neural computation, 1(2):270–280, 1989. (Cited on page 19.)
『完全再帰型ニューラルネットワークを継続的に実行するための学習アルゴリズム』

Mike Wu, Kristy Choi, Noah D. Goodman, and Stefano Ermon. Meta-amortized variational inference and learning. In AAAI, pages 6404–6412, 2020. (Cited on page 7.)
『メタアモルタイズド変分推論と学習』

Yuhuai Wu, Mengye Ren, Renjie Liao, and Roger B. Grosse. Understanding short-horizon bias in stochastic meta-optimization. In ICLR, 2018. (Cited on page 19.)
『確率的メタ最適化における短期ホライズンバイアスの理解』

Yuxin Xiao, Eric P Xing, and Willie Neiswanger. Amortized auto-tuning: Cost-eficient transfer optimization for hyperparameter recommendation. ArXiv preprint, abs/2106.09179, 2021. (Cited on page 7.)
『償却型自動チューニング：ハイパーパラメータ推奨のためのコスト効率の高い転移最適化』

Kevin Xie, Homanga Bharadhwaj, Danijar Hafner, Animesh Garg, and Florian Shkurti. Latent skill planning for exploration and transfer. In ICLR, 2021. (Cited on page 54.)
『潜在スキルの探索と移転のためのプランニング』

Tianju Xue, Alex Beatson, Sigrid Adriaenssens, and Ryan P. Adams. Amortized finite element analysis for fast pde-constrained optimization. In ICML, volume 119, pages 10638–10647, 2020. (Cited on page 7.)
『高速偏微分方程式制約最適化のための償却有限要素解析』

Yuning You, Yue Cao, Tianlong Chen, Zhangyang Wang, and Yang Shen. Bayesian modeling and uncertainty quantification for learning to optimize: What, why, and how. In ICLR, 2022. (Cited on page 29.)
『ベイズモデリングと不確実性定量化による最適化学習：何を、なぜ、どのように』

Fisher Yu and Vladlen Koltun. Multi-scale context aggregation by dilated convolutions. In ICLR, 2016. (Cited on page 13.)
『膨張畳み込みによるマルチスケールコンテキスト集約』

Manzil Zaheer, Satwik Kottur, Siamak Ravanbakhsh, Barnabás Póczos, Ruslan Salakhutdinov, and Alexander J. Smola. Deep sets. In NeurIPS, pages 3391–3401, 2017. (Cited on page 75.)
『ディープセット』

Andrew Zammit-Mangion, Matthew Sainsbury-Dale, and Raphaël Huser. Neural methods for amortized inference. Annual Review of Statistics and Its Application, 12, 2024. (Cited on page 32.)
『ニューラル手法による償却推論』

Ahmed S Zamzam and Kyri Baker. Learning optimal solutions for extremely fast ac optimal power flow. In IEEE International Conference on Communications, Control, and Computing Technologies for Smart Grids (SmartGridComm), pages 1–6. IEEE, 2020. (Cited on page 24.)
『超高速AC最適電力フローのための最適解の学習』

Matthew D Zeiler. Adadelta: an adaptive learning rate method. arXiv preprint arXiv:1212.5701, 2012. (Cited on pages 14 and 28.)
『適応学習率法』

Chongjie Zhang and Victor R. Lesser. Multi-agent learning with policy prediction. In AAAI, 2010. (Cited on page 18.)
『ポリシー予測を伴うマルチエージェント学習』

Chris Zhang, Mengye Ren, and Raquel Urtasun. Graph hypernetworks for neural architecture search. In ICLR, 2019a. (Cited on page 40.)
『ニューラルアーキテクチャ探索のためのグラフハイパーネットワーク』

Junzi Zhang, Brendan O’Donoghue, and Stephen Boyd. Globally convergent type-i anderson acceleration for nonsmooth fixed-point iterations. SIAM Journal on Optimization, 30(4):3170– 3197, 2020. (Cited on page 41.)
『非滑らかな固定点反復のための大域収束型タイプIアンダーソン加速』

Kai Zhang, Wangmeng Zuo, Shuhang Gu, and Lei Zhang. Learning deep CNN denoiser prior for image restoration. In CVPR, 2017. (Cited on page 74.)
『画像復元のためのディープラーニングCNNノイズ除去事前分布の学習』

Xiaojing Zhang, Monimoy Bujarbaruah, and Francesco Borrelli. Safe and near-optimal policy learning for model predictive control using primal-dual neural networks. In American Control Conference (ACC), pages 354–359. IEEE, 2019b. (Cited on page 11.)
『プライマル・デュアルニューラルネットワークを用いたモデル予測制御のための安全かつ準最適な方策学習』

Wenqing Zheng, Tianlong Chen, Ting-Kuei Hu, and Zhangyang Wang. Symbolic learning to optimize: Towards interpretability and scalability. In ICLR, 2022. (Cited on page 28.)
『最適化のための記号学習：解釈可能性とスケーラビリティに向けて』

Andrey Zhmoginov, Mark Sandler, and Maksym Vladymyrov. Hypertransformer: Model generation for supervised and semi-supervised few-shot learning. In ICML, volume 162, pages 27075–27098, 2022. (Cited on page 39.)
『Hypertransformer: 教師ありおよび半教師ありのFew-Shot学習のためのモデル生成』

Luisa M. Zintgraf, Kyriacos Shiarlis, Vitaly Kurin, Katja Hofmann, and Shimon Whiteson. Fast context adaptation via meta-learning. In ICML, volume 97, pages 7693–7702, 2019. (Cited on page 38.)
『メタ学習による高速コンテキスト適応』

Tutorial on amortized optimization
Learning to optimize over continuous spaces
償却最適化のチュートリアル
連続空間での最適化の学習

Bibliography 参考文献

Tutorial on amortized optimization Learning to optimize over continuous spaces償却最適化のチュートリアル 連続空間での最適化の学習

Bibliography 参考文献

Tutorial on amortized optimization
Learning to optimize over continuous spaces
償却最適化のチュートリアル
連続空間での最適化の学習