paper-with-me

홈 › Papers

The geometry of learning

2016-05-02 · Gianluca Calcagni

We establish a correspondence between Pavlovian conditioning processes and fractals. The association strength at a training trial corresponds to a point in a disconnected set at a given iteration level. In this way, one can represent a training process as a hopping on a fractal set, instead of the traditional learning curve as a function of the trial. The main advantage of this novel perspective is to provide an elegant classification of associative theories in terms of the geometric features of fractal sets. In particular, the dimension of fractals can measure the efficiency of conditioning models. We illustrate the correspondence with the examples of the Hull, Rescorla-Wagner, and Mackintosh models and show that they are equivalent to a Cantor set. More generally, conditioning programs are described by the geometry of their associated fractal, which gives much more information than just its dimension. We show this in several examples of random fractals and also comment on a possible relation between our formalism and other "fractal" findings in the cognitive literature.

📄 PDF Abstract BibTeX arXiv:1605.00591

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Gold-medalist Performance in Solving Olympiad Geometry with AlphaGeometry2

2025-02-05 · Yuri Chervonyi, Trieu H. Trinh, Miroslav Olšák, Xiaomeng Yang 외

We present AlphaGeometry2, a significantly improved version of AlphaGeometry introduced in Trinh et al. (2024), which has now surpassed an average gold medalist in solving Olympiad geometry problems. To achieve this, we …

Language ModelingLanguage ModellingMathSynthetic Data Generation

Learning with symmetric positive definite matrices via generalized Bures-Wasserstein geometry

2021-10-20 · Andi Han, Bamdev Mishra, Pratik Jawanpuria, Junbin Gao

Learning with symmetric positive definite (SPD) matrices has many applications in machine learning. Consequently, understanding the Riemannian geometry of SPD matrices has attracted much attention lately. A particular Ri…

Riemannian optimization

Achieving Olympiad-Level Geometry Large Language Model Agent via Complexity Boosting Reinforcement Learning

2025-12-11 · Haiteng Zhao, Junhao Shen, Yiming Zhang, Songyang Gao 외 arxiv

Large language model (LLM) agents exhibit strong mathematical problem-solving abilities and can even solve International Mathematical Olympiad (IMO) level problems with the assistance of formal proof systems. However, du…

Reinforcement Learning

Proposing and solving olympiad geometry with guided tree search

2024-12-14 · Chi Zhang, Jiajun Song, Siyu Li, Yitao Liang 외

Mathematics olympiads are prestigious competitions, with problem proposing and solving highly honored. Building artificial intelligence that proposes and solves olympiads presents an unresolved challenge in automated the…

Bi-FlowGS: Bridging Generative View Completion and Gaussian Geometry through Bidirectional Flow Co-Refinement

2026-09-15 · Yuetong Wang, Jinsheng Quan, Yi Yang, Yawei Luo arxiv

Sparse-view 3D scene reconstruction with 3D Gaussian Splatting (3DGS) is inherently underconstrained. Plausible renderings can also coexist with erroneous Gaussian geometry, as errors in positions or depths may be concea…

Video Restoration