اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدOptimality of constant inflow for a linear system with a bottleneck entrance
219
0
0.0
(
0
)
تأليف
Guy Katriel
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Sadeghi et al. considered a bottleneck system with periodic inflow rate, and proved that a constant-rate input maximizes the time-averaged output rate among all periodic inflow rates. Here we provide a short and elementary proof of this result, without use of optimal control theory. The new approach developed here allows us to prove an extension of the result to the case of a general non-periodic inflow rate.
قيم البحث
اقرأ أيضاً
We consider a nonlinear SISO system that is a cascade of a scalar bottleneck entrance and an arbitrary Hurwitz positive linear system. This system entrains i.e. in response to a $T$-periodic inflow every solution converges to a unique $T$-periodic so
lution of the system. We study the problem of maximizing the averaged throughput via controlled switching. The objective is to choose a periodic inflow rate with a given mean value that maximizes the averaged outflow rate of the system. We compare two strategies: 1) switching between a high and low value, and 2) using a constant inflow equal to the prescribed mean value. We show that no switching policy can outperform a constant inflow rate, though it can approach it asymptotically. We describe several potential applications of this problem in traffic systems, ribosome flow models, and scheduling at security checks.
Motivated by recent progress in data assimilation, we develop an algorithm to dynamically learn the parameters of a chaotic system from partial observations. Under reasonable assumptions, we rigorously establish the convergence of this algorithm to t
he correct parameters when the system in question is the classic three-dimensional Lorenz system. Computationally, we demonstrate the efficacy of this algorithm on the Lorenz system by recovering any proper subset of the three non-dimensional parameters of the system, so long as a corresponding subset of the state is observable. We also provide computational evidence that this algorithm works well beyond the hypotheses required in the rigorous analysis, including in the presence of noisy observations, stochastic forcing, and the case where the observations are discrete and sparse in time.
There is an increasing realization that algorithmic inductive biases are central in preventing overfitting; empirically, we often see a benign overfitting phenomenon in overparameterized settings for natural learning algorithms, such as stochastic gr
adient descent (SGD), where little to no explicit regularization has been employed. This work considers this issue in arguably the most basic setting: constant-stepsize SGD (with iterate averaging) for linear regression in the overparameterized regime. Our main result provides a sharp excess risk bound, stated in terms of the full eigenspectrum of the data covariance matrix, that reveals a bias-variance decomposition characterizing when generalization is possible: (i) the variance bound is characterized in terms of an effective dimension (specific for SGD) and (ii) the bias bound provides a sharp geometric characterization in terms of the location of the initial iterate (and how it aligns with the data covariance matrix). We reflect on a number of notable differences between the algorithmic regularization afforded by (unregularized) SGD in comparison to ordinary least squares (minimum-norm interpolation) and ridge regression.
An inequality refining the lower bound for a periodic (Breitenberger) uncertainty constant is proved for a wide class of functions. A connection of uncertainty constants for periodic and non-periodic functions is extended to this class. A particular
minimization problem for a non-periodic (Heisenberg) uncertainty constant is studied.
Lie symmetries of systems of second-order linear ordinary differential equations with constant coefficients are exhaustively described over both the complex and real fields. The exact lower and upper bounds for the dimensions of the maximal Lie invar
iance algebras possessed by such systems are obtained using an effective algebraic approach.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
