Searcharxiv⌕ Search

arXiv subjects

François Jacquenet

Publications and source records attributed to François Jacquenet.

3 recordsLinked to original sources

Doing More with Less: A Survey on Routing Strategies for Resource Optimisation in Large Language Model-Based Systems

Large Language Model (LLM)-based systems, i.e. interconnected elements that include an LLM as a central component, such as conversational agents, are usually designed with monolithic, static architectures that rely on a single, general-purpose LLM to handle all user queries. However, these systems may be inefficient as different queries may require different levels of reasoning, domain knowledge or pre-processing. While generalist LLMs (e.g. GPT-4o, Claude-Sonnet) perform well across a wide range of tasks, they may incur significant financial, energy and computational costs. These costs may be disproportionate for simpler queries, resulting in unnecessary resource utilisation. A routing mechanism can therefore be employed to route queries to more appropriate components, such as smaller or specialised models, thereby improving efficiency and optimising resource consumption. This survey aims to provide a comprehensive overview of routing strategies in LLM-based systems. Specifically, it reviews when, why, and how routing should be integrated into LLM pipelines to improve efficiency, scalability, and performance. We define the objectives to optimise, such as cost minimisation and performance maximisation, and discuss the timing of routing within the LLM workflow, whether it occurs before or after generation. We also detail the various implementation strategies, including similarity-based, supervised, reinforcement learning-based, and generative methods. Practical considerations such as industrial applications and current limitations are also examined, like standardising routing experiments, accounting for non-financial costs, and designing adaptive strategies. By formalising routing as a performance-cost optimisation problem, this survey provides tools and directions to guide future research and development of adaptive low-cost LLM-based systems.

cs.AI↗

Learning complexity to guide light-induced self-organized nanopatterns

Ultrafast laser irradiation can induce spontaneous self-organization of surfaces into dissipative structures with nanoscale reliefs. These surface patterns emerge from symmetry-breaking dynamical processes that occur in Rayleigh-Bénard-like instabilities. In this study, we demonstrate that the coexistence and competition between surface patterns of different symmetries in two dimensions can be numerically unraveled using the stochastic generalized Swift-Hohenberg model. We originally propose a deep convolutional network to identify and learn the dominant modes that stabilize for a given bifurcation and quadratic model coefficients. The model is scale-invariant and has been calibrated on microscopy measurements using a physics-guided machine learning strategy. Our approach enables the identification of experimental irradiation conditions for a desired self-organization pattern. It can be applied generally to predict structure formation in situations where the underlying physics can be approximately described by a self-organization process and data is sparse and non-time series. Our work paves the way for supervised local manipulation of matter using timely-controlled optical fields in laser manufacturing.

cond-mat.mtrl-sci↗

A Model for Managing Collections of Patterns

Data mining algorithms are now able to efficiently deal with huge amount of data. Various kinds of patterns may be discovered and may have some great impact on the general development of knowledge. In many domains, end users may want to have their data mined by data mining tools in order to extract patterns that could impact their business. Nevertheless, those users are often overwhelmed by the large quantity of patterns extracted in such a situation. Moreover, some privacy issues, or some commercial one may lead the users not to be able to mine the data by themselves. Thus, the users may not have the possibility to perform many experiments integrating various constraints in order to focus on specific patterns they would like to extract. Post processing of patterns may be an answer to that drawback. Thus, in this paper we present a framework that could allow end users to manage collections of patterns. We propose to use an efficient data structure on which some algebraic operators may be used in order to retrieve or access patterns in pattern bases.

cs.AI↗