paper-with-me

Papers

Input Convex Lipschitz RNN: A Fast and Robust Approach for Engineering Tasks

2024-01-15 · ZiHao Wang, Zhe Wu

Computational efficiency and robustness are essential in process modeling, optimization, and control for real-world engineering applications. While neural network-based approaches have gained significant attention in recent years, conventional neural networks often fail to address these two critical aspects simultaneously or even independently. Inspired by natural physical systems and established literature, input convex architectures are known to enhance computational efficiency in optimization tasks, whereas Lipschitz-constrained architectures improve robustness. However, combining these properties within a single model requires careful review, as inappropriate methods for enforcing one property can undermine the other. To overcome this, we introduce a novel network architecture, termed Input Convex Lipschitz Recurrent Neural Networks (ICLRNNs). This architecture seamlessly integrates the benefits of convexity and Lipschitz continuity, enabling fast and robust neural network-based modeling and optimization. The ICLRNN outperforms existing recurrent units in both computational efficiency and robustness. Additionally, it has been successfully applied to practical engineering scenarios, such as modeling and control of chemical process and the modeling and real-world solar irradiance prediction for solar PV system planning at LHT Holdings in Singapore. Source code is available at https://github.com/killingbear999/ICLRNN.

📄 PDF Abstract BibTeX arXiv:2401.07494

Code (1)

killingbear999/iclrnn 공식 구현 tf

Tasks

Chemical ProcessComputational EfficiencyModel Predictive ControlNon-Adversarial RobustnessSolar Irradiance Forecasting

Similar Papers 제목 키워드 기반

Monotone, Bi-Lipschitz, and Polyak-Lojasiewicz Networks

2024-02-02 · Ruigang Wang, Krishnamurthy Dvijotham, Ian R. Manchester

This paper presents a new bi-Lipschitz invertible neural network, the BiLipNet, which has the ability to smoothly control both its Lipschitzness (output sensitivity to input perturbations) and inverse Lipschitzness (inpu…

A simple uniformly optimal method without line search for convex optimization

2023-10-16 · Tianjiao Li, Guanghui Lan

Line search (or backtracking) procedures have been widely employed into first-order methods for solving convex optimization problems, especially those with unknown problem parameters (e.g., Lipschitz constant). In this p…

Rethinking SIGN Training: Provable Nonconvex Acceleration without First- and Second-Order Gradient Lipschitz

2023-10-23 · Tao Sun, Congliang Chen, Peng Qiao, Li Shen 외

Sign-based stochastic methods have gained attention due to their ability to achieve robust performance despite using only the sign information for parameter updates. However, the current convergence analysis of sign-base…

Fast Stochastic Variance Reduced ADMM for Stochastic Composition Optimization

2017-05-11 · Yue Yu, Longbo Huang

We consider the stochastic composition optimization problem proposed in \cite{wang2017stochastic}, which has applications ranging from estimation to statistical and machine learning. We propose the first ADMM-based algor…

BIG-bench Machine Learning

Revisiting Projection-Free Optimization for Strongly Convex Constraint Sets

2018-11-14 · Jarrid Rector-Brooks, Jun-Kun Wang, Barzan Mozafari

We revisit the Frank-Wolfe (FW) optimization under strongly convex constraint sets. We provide a faster convergence rate for FW without line search, showing that a previously overlooked variant of FW is indeed faster tha…