English
Related papers

Related papers: A-priori error analysis of local incremental minim…

200 papers

This paper is concerned with an approximation scheme for rate-independent systems governed by a non-smooth dissipation and a possibly non-convex energy functional. The scheme is based on the local minimization scheme introduced in [EM06],…

Numerical Analysis · Mathematics 2021-05-03 Michael Sievers

We investigate a local incremental stationary scheme for the numerical solution of rate-independent systems. Such systems are characterized by a (possibly) non-convex energy and a dissipation potential, which is positively homogeneous of…

Numerical Analysis · Mathematics 2022-04-13 Merlin Andreia , Christian Meyer

It is well known that rate-independent systems involving nonconvex energy functionals in general do not allow for time-continuous solutions even if the given data are smooth. In the last years, several solution concepts were proposed that…

Analysis of PDEs · Mathematics 2017-12-20 Dorothee Knees

We develop adaptive discretization algorithms for locally optimal experimental design of nonlinear prediction models. With these algorithms, we refine and improve a pertinent state-of-the-art algorithm in various respects. We establish…

Optimization and Control · Mathematics 2024-06-04 Jochen Schmid , Philipp Seufert , Michael Bortz

This paper focuses on investigating an inexact stochastic model-based optimization algorithm that integrates preconditioning techniques for solving stochastic composite optimization problems. The proposed framework unifies and extends the…

Optimization and Control · Mathematics 2025-12-12 Chenglong Bao , Yancheng Yuan , Shulan Zhu

This paper focuses on recursive estimation of time varying autoregressive processes in a nonparametric setting. The stability of the model is revisited and uniform results are provided when the time-varying autoregressive parameters belong…

Statistics Theory · Mathematics 2007-06-13 Eric Moulines , Pierre Priouret , François Roueff

Exact free energy minimization is a convex optimization problem that is usually approximated with stochastic sampling methods. Deterministic approximations have been less successful because many desirable properties have been difficult to…

Computational Physics · Physics 2016-03-17 Jonathan E. Moussa

In structured prediction problems where we have indirect supervision of the output, maximum marginal likelihood faces two computational obstacles: non-convexity of the objective and intractability of even a single gradient computation. In…

Machine Learning · Statistics 2016-08-11 Aditi Raghunathan , Roy Frostig , John Duchi , Percy Liang

We derive an implicit numerical scheme for the solution of advection equation where the roles of space and time variables are exchanged using the inverse Lax-Wendroff procedure. The scheme contains a linear weight for which it is always…

Numerical Analysis · Mathematics 2025-05-12 Peter Frolkovič , Svetlana Krišková , Katarína Lacková

Minibatch decomposition methods for empirical risk minimization are commonly analysed in a stochastic approximation setting, also known as sampling with replacement. On the other hands modern implementations of such techniques are…

Machine Learning · Computer Science 2023-01-09 Edouard Pauwels

In this paper, we initiate a systematic investigation of differentially private algorithms for convex empirical risk minimization. Various instantiations of this problem have been studied before. We provide new algorithms and matching lower…

Machine Learning · Computer Science 2014-10-21 Raef Bassily , Adam Smith , Abhradeep Thakurta

A family of implicit-in-time mixed finite element schemes is presented for the numerical approximation of the acoustic wave equation. The mixed space discretization is based on the displacement form of the wave equation and the…

Numerical Analysis · Mathematics 2015-04-17 Samir Karaa

We investigate implicit regularization schemes for gradient descent methods applied to unpenalized least squares regression to solve the problem of reconstructing a sparse signal from an underdetermined system of linear measurements under…

Machine Learning · Statistics 2019-09-12 Tomas Vaškevičius , Varun Kanade , Patrick Rebeschini

We provide for first order discretizations of the integral fractional Laplacian sharp local error estimates on proper subdomains in both the local $H^1$-norm and the localized energy norm. Our estimates have the form of a local best…

Numerical Analysis · Mathematics 2024-07-25 Markus Faustmann , Michael Karkulik , Jens Markus Melenk

We propose an accelerated meta-algorithm, which allows to obtain accelerated methods for convex unconstrained minimization in different settings. As an application of the general scheme we propose nearly optimal methods for minimizing…

We design a non-convex second-order optimization algorithm that is guaranteed to return an approximate local minimum in time which scales linearly in the underlying dimension and the number of training examples. The time complexity of our…

Optimization and Control · Mathematics 2017-04-26 Naman Agarwal , Zeyuan Allen-Zhu , Brian Bullins , Elad Hazan , Tengyu Ma

The paper provides global optimization algorithms for two particularly difficult nonconvex problems raised by hybrid system identification: switching linear regression and bounded-error estimation. While most works focus on local…

Machine Learning · Computer Science 2017-11-27 Fabien Lauer

This paper is concerned about the implicit-explicit (IMEX) methods for a class of dissipative wave systems with time-varying velocity feedbacks and nonlinear potential energies, equipped with different boundary conditions. Firstly, we…

Numerical Analysis · Mathematics 2024-10-29 Zhe Jiao , Yaxu Li , Lijing Zhao

We consider the discretization of parabolic initial boundary value problems by finite element methods in space and a Runge-Kutta time stepping scheme. Order optimal a-priori error estimates are derived in an energy-norm under natural…

Numerical Analysis · Mathematics 2015-07-21 Herbert Egger

Majorization-minimization algorithms consist of successively minimizing a sequence of upper bounds of the objective function. These upper bounds are tight at the current estimate, and each iteration monotonically drives the objective…

Optimization and Control · Mathematics 2015-02-03 Julien Mairal
‹ Prev 1 2 3 10 Next ›