Local and Global Optima: Sheaves and Polynomial Approximations
In this paper, we analyze how global optima of an agent's preferences can be reconstructed from the solutions found for local problems. A sheaf-theoretic analysis provides an abstract characterization of the global solution, and polynomial approximations are obtained when only a few local instances are available.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Optimal Piecewise Local-Linear Approximations
Existing works on "black-box" model interpretation use local-linear approximations to explain the predictions made for each data instance in terms of the importance assigned to the different features for arriving at the …
ClusteringLocal vs Global continual learning
Continual learning is the problem of integrating new information in a model while retaining the knowledge acquired in the past. Despite the tangible improvements achieved in recent years, the problem of continual learnin…
Continual LearningIncremental Sheaf Cohomology on Cellular Complexes: O(1)-in-n Lazy Edit Processing under Bounded Local Geometry
We present an algorithmic framework for incremental maintenance of first sheaf cohomology $H^1(X; \mathcal{F})$ on dynamically evolving 1-dimensional cellular complexes equipped with finite-dimensional cellular sheaves. …
Sheaves as a Framework for Understanding and Interpreting Model Fit
As data grows in size and complexity, finding frameworks which aid in interpretation and analysis has become critical. This is particularly true when data comes from complex systems where extensive structure is available…
Consequences of Kernel Regularity for Bandit Optimization
In this work we investigate the relationship between kernel regularity and algorithmic performance in the bandit optimization of RKHS functions. While reproducing kernel Hilbert space (RKHS) methods traditionally rely on…