Related papers: Revisiting Chien-Hrones-Reswick Method for an Anal…

When solving the American options with or without dividends, numerical methods often obtain lower convergence rates if further treatment is not implemented even using high-order schemes. In this article, we present a fast and explicit…

The traditional finite-difference time-domain (FDTD) method is constrained by the Courant-Friedrich-Levy (CFL) condition and suffers from the notorious staircase error in electromagnetic simulations. This paper proposes a three-dimensional…

We propose a new class of high-order time-marching schemes with dissipation user-control and unconditional stability for parabolic equations. High-order time integrators can deliver the optimal performance of highly-accurate and robust…

Representation Fine-tuning (ReFT), a recently proposed Parameter-Efficient Fine-Tuning (PEFT) method, has attracted widespread attention for significantly improving parameter efficiency by editing representation space alone. In this work,…

This paper uncovers a critical yet overlooked phenomenon in multi-modal large language models (MLLMs): detrimental concept drift within chain-of-thought (CoT) reasoning during non-stationary reinforcement fine-tuning (RFT), where reasoning…

This study proposes a one-shot data-driven tuning method for a fractional-order proportional-integral-derivative (FOPID) controller. The proposed method tunes the FOPID controller in the model-reference control formulation. A loss function…

In this article, a novel Finite Time Stability (FTS) analysis of Fractional-Order Time Delay Systems (FOTDSs) is proposed. By using the fixed point approach, sufficient conditions for the robust FTS of FOTDSs have been established. Two…

This paper presents a framework to solve constrained optimization problems in an accelerated manner based on High-Order Tuners (HT). Our approach is based on reformulating the original constrained problem as the unconstrained optimization…

Some variant of the Frank-Wolfe method for convex optimization problems with adaptive selection of the step parameter corresponding to information about the smoothness of the objective function (the Lipschitz constant of the gradient).…

This paper presents a new parameter estimation algorithm for the adaptive control of a class of time-varying plants. The main feature of this algorithm is a matrix of time-varying learning rates, which enables parameter estimation error…

We consider the problem of asynchronous stochastic optimization, where an optimization algorithm makes updates based on stale stochastic gradients of the objective that are subject to an arbitrary (possibly adversarial) sequence of delays.…

While reachability analysis is one of the most promising approaches for formal verification of dynamic systems, a major disadvantage preventing a more widespread application is the requirement to manually tune algorithm parameters such as…

Supervised Fine-Tuning (SFT) has been a go-to and effective method for enhancing long chain-of-thought (CoT) reasoning in relatively small LLMs by fine-tuning them with long CoT responses from larger LLMs. To continually improve reasoning…

In this paper, we present a new parametrization to perform direct data-driven analysis and controller synthesis for the error-in-variables case. To achieve this, we employ the Sherman-Morrison-Woodbury formula to transform the problem into…

In this paper, we propose a novel bootstrap algorithm that is more efficient than existing methods for approximating the distribution of the factor-augmented regression estimator for a rotated parameter vector. The regression is augmented…

We develop new accelerated first-order algorithms in the Frank-Wolfe (FW) family for minimizing smooth convex functions over compact convex sets, with a focus on two prominent constraint classes: (1) polytopes and (2) matrix domains given…

This paper studies the numerical approximation of parametric time-dependent partial differential equations (PDEs) by proper orthogonal decomposition reduced order models (POD-ROMs). Although many papers in the literature consider reduced…

We develop time integration methods in low-rank representation that can adaptively adjust approximation ranks to achieve a prescribed accuracy, while ensuring that these ranks remain proportional to the corresponding best approximation…

The primary focus of this paper is on designing an inexact first-order algorithm for solving constrained nonlinear optimization problems. By controlling the inexactness of the subproblem solution, we can significantly reduce the…

This paper focuses on the design of sequential quadratic optimization (commonly known as SQP) methods for solving large-scale nonlinear optimization problems. The most computationally demanding aspect of such an approach is the computation…