Search

This paper presents a systematic review of the infrastructure requirements for deploying Large Language Models (LLMs) on-device within the context of small and medium-sized enterprises (SMEs), focusing on both hardware and software perspectives. From the hardware viewpoint, we discuss the utilization of processing units like GPUs and TPUs, efficient memory and storage solutions, and strategies for effective deployment, addressing the challenges of limited computational resources typical in SME settings. From the software perspective, we explore framework compatibility, operating system optimization, and the use of specialized libraries tailored for resource-constrained environments. The review is structured to first identify the unique challenges faced by SMEs in deploying LLMs on-device, followed by an exploration of the opportunities that both hardware innovations and software adaptations offer to overcome these obstacles. Such a structured review provides practical insights, contributing significantly to the community by enhancing the technological resilience of SMEs in integrating LLMs., Comment: 9 pages, 1 figure. The work is supported by the SIT-NVIDIA Joint AI Centre

This paper studies value iteration for infinite horizon contracting Markov decision processes under convexity assumptions and when the state space is uncountable. The original value iteration is replaced with a more tractable form and the fixed points from the modified Bellman operators will be shown to converge uniformly on compacts sets to their original counterparts. This holds under various sampling approaches for the random disturbances. Moreover, this paper will present conditions in which these fixed points form monotone sequences of lower bounding or upper bounding functions for the original fixed point. This approach is then demonstrated numerically on a perpetual Bermudan put option., Comment: 16 pages

This short paper gives an introduction to the \emph{rcss} package. The R package \emph{rcss} provides users with a tool to approximate the value functions in the Bellman recursion using convex piecewise linear functions formed using operations on tangents. A pathwise method is then used to gauge the quality of the numerical results., Comment: 13 pages

This short paper briefly describes the implementation of the least squares Monte Carlo method in the rlsm package. This package provides users with an easy manner to experiment with the large amount of R regression tools on any regression basis and reward functions. This package also computes lower and upper bounds for the true value function via duality methods., Comment: 9 pages

This paper studies function approximation for finite horizon discrete time Markov decision processes under certain convexity assumptions. Uniform convergence of these approximations on compact sets is proved under several sampling schemes for the driving random variables. Under some conditions, these approximations form a monotone sequence of lower or upper bounding functions. Numerical experiments involving piecewise linear functions demonstrate that very tight bounding functions for the fair price of a Bermudan put option can be obtained with excellent speed (fractions of a cpu second). Results in this paper can be easily adapted to minimization problems involving concave Bellman functions., Comment: 23 pages

The increased market penetration of renewable energy sources and the rapid development of electric battery storage technologies yield a potential for reducing electricity price volatility while maintaining stability of the power grid. This work presents an algorithmic approach to control battery levels and forward positions to optimally manage power output fluctuations caused by intermittent renewable energy generation. This paper will also explore the effect of battery technology on the firm's optimal trading behaviour in the electricity spot market.

Complexity and uncertainty associated with commodity resource valuation and extraction requires stochastic control methods suitable for high dimensional states. Recent progress in duality and trajectory-wise techniques has introduced a variety of fresh ideas to this field with surprising results. This paper presents a first application of this promising development to commodity extraction problems. We introduce efficient algorithms for obtaining approximate solutions along with a diagnostic technique, which provides a quantitative measure for solution performance in terms of the distance between the approximate and the optimal control policy., Comment: 17 pages, 5 figures and 5 tables. Fixed some minor typos