Publication
Identifying physical properties of deformable objects by using particle filters
Abstract
This paper presents a new approach for estimating physical properties of deformable models from experimental measurements. In contrast to most previous work, we introduce a new method based on particle filters which identifies the different stiffness properties for spring-based models. This approach addresses some important limitations encountered with gradient descent techniques which often converge towards ill solutions or remain fixed in local minima conditions.
Official source
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
Ontological neighbourhood
Related concepts (29)
Condition number
In numerical analysis, the condition number of a function measures how much the output value of the function can change for a small change in the input argument. This is used to measure how sensitive a function is to changes or errors in the input, and how much error in the output results from an error in the input. Very frequently, one is solving the inverse problem: given one is solving for x, and thus the condition number of the (local) inverse must be used.
Numerical analysis
Numerical analysis is the study of algorithms that use numerical approximation (as opposed to symbolic manipulations) for the problems of mathematical analysis (as distinguished from discrete mathematics). It is the study of numerical methods that attempt at finding approximate solutions of problems rather than the exact ones. Numerical analysis finds application in all fields of engineering and the physical sciences, and in the 21st century also the life and social sciences, medicine, business and even the arts.
Gradient descent
In mathematics, gradient descent (also often called steepest descent) is a iterative optimization algorithm for finding a local minimum of a differentiable function. The idea is to take repeated steps in the opposite direction of the gradient (or approximate gradient) of the function at the current point, because this is the direction of steepest descent. Conversely, stepping in the direction of the gradient will lead to a local maximum of that function; the procedure is then known as gradient ascent.
Related publications (33)
On the symmetries in the dynamics of wide two-layer neural networks
We consider the idealized setting of gradient flow on the population risk for infinitely wide two-layer ReLU neural networks (without bias), and study the effect of symmetries on the learned parameters and predictors. We first describe a general class of s ...
AMER INST MATHEMATICAL SCIENCES-AIMS2023Augmented Lagrangian Methods for Provable and Scalable Machine Learning
Non-convex constrained optimization problems have become a powerful framework for modeling a wide range of machine learning problems, with applications in k-means clustering, large- scale semidefinite programs (SDPs), and various other tasks. As the perfor ...
EPFL2023Last iterate convergence of SGD for Least-Squares in the Interpolation regime
Nicolas Henri Bernard Flammarion, Aditya Vardhan Varre, Loucas Pillaud-Vivien
Motivated by the recent successes of neural networks that have the ability to fit the data perfectly \emph{and} generalize well, we study the noiseless model in the fundamental least-squares setup. We assume that an optimum predictor fits perfectly inputs ...
2021Related MOOCs (19)
Matlab & octave for beginners
Premiers pas dans MATLAB et Octave avec un regard vers le calcul scientifique
Matlab & octave for beginners
Premiers pas dans MATLAB et Octave avec un regard vers le calcul scientifique
MATLAB and Octave for Beginners
Learn MATLAB and Octave and start experimenting with matrix manipulations, data visualizations, functions and mathematical computations.