paper-with-me

홈 › Papers

$\mathcal{C}^k$-continuous Spline Approximation with TensorFlow Gradient Descent Optimizers

2023-03-22 · Stefan Huber, Hannes Waclawek

In this work we present an "out-of-the-box" application of Machine Learning (ML) optimizers for an industrial optimization problem. We introduce a piecewise polynomial model (spline) for fitting of $\mathcal{C}^k$-continuos functions, which can be deployed in a cam approximation setting. We then use the gradient descent optimization context provided by the machine learning framework TensorFlow to optimize the model parameters with respect to approximation quality and $\mathcal{C}^k$-continuity and evaluate available optimizers. Our experiments show that the problem solution is feasible using TensorFlow gradient tapes and that AMSGrad and SGD show the best results among available TensorFlow optimizers. Furthermore, we introduce a novel regularization approach to improve SGD convergence. Although experiments show that remaining discontinuities after optimization are small, we can eliminate these errors using a presented algorithm which has impact only on affected derivatives in the local spline segment.

📄 PDF Abstract BibTeX arXiv:2303.12454

Code (0)

등록된 구현이 없습니다.

Methods 이 논문이 사용한 방법론

SGD Stochastic Gradient Descent is an iterative optimization technique that uses minibatches of data to form an expectation of the gradient, rather than the full gradient using…
AMSGrad AMSGrad is a stochastic optimization method that seeks to fix a convergence issue with Adam based optimizers. AMSGrad uses the…
CAM Class activation maps could be used to interpret the prediction decision made by the convolutional neural network (CNN). Image source: [Learning Deep Features for…

Similar Papers 제목 키워드 기반

Efficient Derivative Computation for Cumulative B-Splines on Lie Groups

2019-11-20 · CVPR 2020 6 · Christiane Sommer, Vladyslav Usenko, David Schubert, Nikolaus Demmel 외

Continuous-time trajectory representation has recently gained popularity for tasks where the fusion of high-frame-rate sensors and multiple unsynchronized devices is required. Lie group cumulative B-splines are a popular…

Policy Gradient for Continuous-Time Robust Markov Decision Processes

2026-06-03 · Tanya Veeravalli, David M. Bossens, Atsushi Nitanda arxiv

The framework of robust Markov decision processes (RMDPs) allows the design of reinforcement learning agents that satisfy performance guarantees under worst-case transition dynamics. Traditional RMDPs consider discrete-t…

Reinforcement Learning

Deep Unrolling of Sparsity-Induced RDO for 3D Point Cloud Attribute Coding

2025-09-10 · Tam Thuc Do, Philip A. Chou, Gene Cheung arxiv

Given encoded 3D point cloud geometry available at the decoder, we study the problem of lossy attribute compression in a multi-resolution B-spline projection framework. A target continuous 3D attribute function is first …

Kolmogorov-Arnold Networks: Approximation and Learning Guarantees for Functions and their Derivatives

2025-04-21 · Anastasis Kratsios, Takashi Furuya

Inspired by the Kolmogorov-Arnold superposition theorem, Kolmogorov-Arnold Networks (KANs) have recently emerged as an improved backbone for most deep learning frameworks, promising more adaptivity than their multilayer …

Kolmogorov-Arnold Networks

Optimal Approximation Rate of ReLU Networks in terms of Width and Depth

2021-02-28 · Zuowei Shen, Haizhao Yang, Shijun Zhang

This paper concentrates on the approximation power of deep feed-forward neural networks in terms of width and depth. It is proved by construction that ReLU networks with width $\mathcal{O}\big(\max\{d\lfloor N^{1/d}\rflo…