arXiv:1502.05313
Variational Optimization of Annealing Schedules
원문 초록
Annealed importance sampling (AIS) is a common algorithm to estimate partition functions of useful stochastic models. One important problem for obtaining accurate AIS estimates is the selection of an annealing schedule. Conventionally, an annealing schedule is often determined heuristically or is simply set as a linearly increasing sequence. In this paper, we propose an algorithm for the optimal schedule by deriving a functional that dominates the AIS estimation error and by numerically minimizing this functional. We experimentally demonstrate that the proposed algorithm mostly outperforms conventional scheduling schemes with large quantization numbers.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
An End-to-End DNN Inference Framework for the SpiNNaker2 Neuromorphic MPSoC
Deep Learning Model Acceleration and Optimization Strategies for Real-Time Recommendation Systems
Enhancing Convergence, Privacy and Fairness for Wireless Personalized Federated Learning: Quantization-Assisted Min-Max Fair Scheduling
Efficient and Workload-Aware LLM Serving via Runtime Layer Swapping and KV Cache Resizing
Optimal Sensor Scheduling and Selection for Continuous-Discrete Kalman Filtering with Auxiliary Dynamics
SystolicAttention: Fusing FlashAttention within a Single Systolic Array
토론
이 논문과 연결된 포럼 글이 아직 없습니다.