Search

The sample compression theory provides generalization guarantees for predictors that can be fully defined using a subset of the training dataset and a (short) message string, generally defined as a binary sequence. Previous works provided generalization bounds for the zero-one loss, which is restrictive notably when applied to deep learning approaches. In this paper, we present a general framework for deriving new sample compression bounds that hold for real-valued unbounded losses. Using the Pick-To-Learn (P2L) meta-algorithm, which transforms the training method of any machine-learning predictor to yield sample-compressed predictors, we empirically demonstrate the tightness of the bounds and their versatility by evaluating them on random forests and multiple types of neural networks.

Splay trees are a simple and efficient dynamic data structure, invented by Sleator and Tarjan. The basic primitive for transforming a binary tree in this scheme is a rotation. Sleator, Tarjan, and Thurston proved that the maximum rotation distance between trees with n internal nodes is exactly 2n-6 for trees with n internal nodes (where n is larger than some constant). The proof of the upper bound is easy but the proof of the lower bound, remarkably, uses sophisticated arguments based on calculating hyperbolic volumes. We give an elementary proof of the same result. The main interest of the paper lies in the method, which is new. It basically relies on a potential function argument, similar to many amortized analyses. However, the potential of a tree is not defined explicitly, but by constructing an instance of a flow problem and using the max-flow min-cut theorem.

We demonstrate an external cavity laser with intrinsic linewidth below 100 Hz around an operating wavelength of 852 nm, selected for its relevance to laser cooling and manipulation of cesium atoms. This system achieves a maximum CW output power of 24 mW, wavelength tunability over 15 nm, and a side-mode suppression ratio exceeding 50 dB. This performance level is facilitated by careful design of a low-loss integrated silicon nitride photonic circuit serving as the external cavity combined with commercially available semiconductor gain chips. This approach demonstrates the feasibility of compact integrated lasers with sub-kHz linewidth centering on the needs of emerging sensor concepts based on ultracold atoms and can be further extended to shorter wavelengths via selection of suitable semiconductor gain media.

We introduce a general detection-based approach to text line recognition, be it printed (OCR) or handwritten (HTR), with Latin, Chinese, or ciphered characters. Detection-based approaches have until now been largely discarded for HTR because reading characters separately is often challenging, and character-level annotation is difficult and expensive. We overcome these challenges thanks to three main insights: (i) synthetic pre-training with sufficiently diverse data enables learning reasonable character localization for any script; (ii) modern transformer-based detectors can jointly detect a large number of instances, and, if trained with an adequate masking strategy, leverage consistency between the different detections; (iii) once a pre-trained detection model with approximate character localization is available, it is possible to fine-tune it with line-level annotation on real data, even with a different alphabet. Our approach, dubbed DTLR, builds on a completely different paradigm than state-of-the-art HTR methods, which rely on autoregressive decoding, predicting character values one by one, while we treat a complete line in parallel. Remarkably, we demonstrate good performance on a large range of scripts, usually tackled with specialized approaches. In particular, we improve state-of-the-art performances for Chinese script recognition on the CASIA v2 dataset, and for cipher recognition on the Borg and Copiale datasets. Our code and models are available at https://github.com/raphael-baena/DTLR.

Mean field type games (MFTGs) describe Nash equilibria between large coalitions: each coalition consists of a continuum of cooperative agents who maximize the average reward of their coalition while interacting non-cooperatively with a finite number of other coalitions. Although the theory has been extensively developed, we are still lacking efficient and scalable computational methods. Here, we develop reinforcement learning methods for such games in a finite space setting with general dynamics and reward functions. We start by proving that MFTG solution yields approximate Nash equilibria in finite-size coalition games. We then propose two algorithms. The first is based on quantization of the mean-field spaces and Nash Q-learning. We provide convergence and stability analysis. We then propose an deep reinforcement learning algorithm, which can scale to larger spaces. Numerical examples on 5 environments show the scalability and the efficiency of the proposed method.

Context: Over the last decade, the forestry sector has undergone substantial changes, evolving from a post-2008 financial crisis landscape to incorporating policies favoring sustainable and green alternatives, especially after the 2015 Paris agreement. This evolution was drastically disrupted with the advent of the COVID-19 pandemic in 2020, causing unprecedented interruptions in supply chains, product markets, and data collection. Grasping the aftermath of the COVID-19, regional instances of the forest supply chain sector need synthetic pictures of their present state and future opportunities for emerging wood products and better regional-scale carbon balance. But given the impact of COVID-19 lock-down on data collection, the production of such synthetic pictures has become more complex, yet essential. This was the case for the regional supply chain of the Grand-Est region in France that we studied. Aims: For this study, our aim was to demonstrate that an integrated methodology could provide such synthetic picture even though we sued heterogenous sources of data and different analytical objectives: i.e. (1) retrospectively evaluate the aftermath of COVID-19 pandemic on the supply chain outcomes within the forestry sector; and then (2) retrospectively explore possible options of structural change of regional supply chain that would be required to simultaneously recover from COVID-19 and transit to new objectives in line with the extraction of new bio-molecules from wood biomass, and with the reduction of the regional scale carbon footprint (in line with the IPCC Paris Agreement) Methods: To achieve this, our methodological approach was decomposed into three steps. We first used a Material Flow Analysis (MFA) recently conducted on the forestry sector in the Grand Est region to establish a Sankey diagram (i.e. a schematic representation of industrial sectors and biomass flows along the supply chain) for the pre-Covid-19 period (2014-2018). Then we compared pre-Covid-19 Sankey diagram to the only source of data we could access from the post-Covid-19 period (2020-2021) in order to estimate the impact of Covid-19. Finally, we used as input the reconciled supply chain model into a consequential Wood Product Model (WPMs), called CAT (carbon accounting tool) in order to compare three prospective scenarios: (1) a scenario that projected 2020-2021 Covid-19 conditions and assumed pre-Covid-19 business as usual practices, (2) a scenario illustrating the consequence or rerouting some of the biomass to satisfy the expected increase in pulp and paper production to satisfy the needs of the industry after Covid-19, and (3) a scenario that explored new opportunities in term of extraction of novel bio-molecules by the emerging biochemical wood industry. For every scenario we also evaluated the regional carbon gains and losses that these changes implied. Results: Our study conducted a detailed analysis of the impacts of the COVID-19 pandemic on the forestry sector's supply chain in the Grand Est region, using a dynamic and integrated Wood Product Model. We found significant disruptions during the pandemic period, with notable declines in industrial wood chips and timber hardwood production by 41.8% and 40%, respectively. Conversely, there were substantial increases in fuelwood, timber sawdust, and timber softwood, rising by 14.15%, 44.23%, and 15.29% respectively. These fluctuations underscore the resilience and vulnerabilities within the regional wood supply chain. Our findings also emphasize the potential for strategic rerouting of biomass flows to meet changing industry demands, which could play a crucial role in supporting the sector's recovery and adaptation to post-pandemic conditions. Discussion and conclusion: In addition, our study recognizes the limitations of the current approach combining MFA and WPM and suggests potential areas of enhancement. Ultimately, our findings shed light on the need to develop more integrated analytical methods to provide useful synthetic pictures of regional scale supply chains, when there is a need to adapt it to evolving situations and complex data landscapes.

The performance of software systems remains a persistent concern in the field of software engineering. While traditional metrics like binary size and execution time have long been focal points for developers, the power consumption concern has gained significant attention, adding a layer of complexity to performance evaluation. Configurable software systems, with their potential for numerous configurations, further complicate this evaluation process. In this experience paper, we examine the impact of configurations on performance, specifically focusing on the web stack generator JHipster. Our goal is to understand how configuration choices within JHipster influence the performance of the generated system. We undertake an exhaustive analysis of JHipster by examining its configurations and their effects on system performance. Additionally, we explore individual configuration options to gauge their specific influence on performance. Through this process, we develop a comprehensive performance model for JHipster, enabling us to automate the identification of configurations that optimize specific performance metrics. In particular, we identify configurations that demonstrate near-optimal performance across multiple indicators and report on significant correlations between configuration choices within JHipster and the performance of generated systems.

Observables in expanding universes are crucial to understand the physics of the early universe. In these lectures, we review some recent progress in understanding their mathematical structure and extract the physics encoded in them. After discussing the most salient features of an expanding background and their consequences for defining an observable, we focus on the so-called Bunch--Davies wavefunctional. We analyze its analytic properties on general grounds and introduce an integral representation for it in perturbation theory for a special class of scalar toy models. We discuss both the diagrammatics associated to the usual Feynman rules and combinatorial rules on the graphs, which generate a representation free of spurious poles. Such combinatorial rules find their origin in the combinatorics of the cosmological polytopes of which we provide a gentle introduction to its definition and its main features. Finally, the combinatorics of the cosmological polytopes turns out to determine the combinatorics of a special class of nestohedra that encode the asymptotic behaviour of the cosmological integrals. We provide a general description of such structures and behaviour, which is of crucial importance to understand the infrared divergences which plague observables in an expanding background. These notes are based on a series of lectures held during the S-Matrix Marathon workshop at the Institute for Advanced Study on 11--22 March 2024., Comment: 32 pages. A chapter to be published by Springer Lecture Notes in Physics

Understanding the topological characteristics of data is important to many areas of research. Recent work has demonstrated that synthetic 4D image-type data can be useful to train 4D convolutional neural network models to see topological features in these data. These models also appear to tolerate the use of image preprocessing techniques where existing topological data analysis techniques such as persistent homology do not. This paper investigates how methods from algebraic topology, combined with image processing techniques such as morphology, can be used to generate topologically sophisticated and diverse-looking 2-, 3-, and 4D image-type data with topological labels in simulation. These approaches are illustrated in 2D and 3D with the aim of providing a roadmap towards achieving this in 4D., Comment: 8 pages, DICTA 2024

The accuracy of atomistic simulations depends on the precision of force fields. Traditional numerical methods often struggle to optimize the empirical force field parameters for reproducing target properties. Recent approaches rely on training these force fields based on forces and energies from first-principle simulations. However, it is unclear whether these approaches will enable capturing complex material responses such as vibrational, or elastic properties. To this extent, we introduce a framework, employing inner loop simulations and outer loop optimization, that exploits automatic differentiation for both property prediction and force-field optimization by computing gradients of the simulation analytically. We demonstrate the approach by optimizing classical Stillinger-Weber and EDIP potentials for silicon systems to reproduce the elastic constants, vibrational density of states, and phonon dispersion. We also demonstrate how a machine-learned potential can be fine-tuned using automatic differentiation to reproduce any target property such as radial distribution functions. Interestingly, the resulting force field exhibits improved accuracy and generalizability to unseen temperatures than those fine-tuned on energies and forces. Finally, we demonstrate the extension of the approach to optimize the force fields towards multiple target properties. Altogether, differentiable simulations, through the analytical computation of their gradients, offer a powerful tool for both theoretical exploration and practical applications toward understanding physical systems and materials., Comment: 15 pages, 5 figures

Diabetic retinopathy and diabetic macular edema are significant complications of diabetes that can lead to vision loss. Early detection through ultra-widefield fundus imaging enhances patient outcomes but presents challenges in image quality and analysis scale. This paper introduces deep learning solutions for automated UWF image analysis within the framework of the MICCAI 2024 UWF4DR challenge. We detail methods and results across three tasks: image quality assessment, detection of referable DR, and identification of DME. Employing advanced convolutional neural network architectures such as EfficientNet and ResNet, along with preprocessing and augmentation strategies, our models demonstrate robust performance in these tasks. Results indicate that deep learning can significantly aid in the automated analysis of UWF images, potentially improving the efficiency and accuracy of DR and DME detection in clinical settings.

The intensity noise of a laser source represents one of the key factors limiting the ultimate sensitivity in laser-based systems for sensing and telecommunication. For advanced applications based on interferometry, the availability of a shot-noise-limited local oscillator is even more important for the effective feasibility of high-precision measurements. This is particularly crucial in quantum optics applications based on homodyne detection schemes to measure non-classical light states, such as squeezed states. This work deeply investigates and analyzes the intensity noise features of the most widely used mid-infrared semiconductor heterostructured lasers: quantum cascade and interband cascade lasers. For this purpose, a comprehensive comparison of three different continuous-wave lasers operating at room temperature around 4.5 {\mu}m wavelength is presented. First, a thorough electro-optical characterization is given, highlighting the differences and the shared common characteristics of the tested devices. Then, a detailed intensity noise analysis is reported, identifying their different noise operations with a particular reference to shot-noise-limited operations. Finally, some perspectives towards advanced applications are discussed., Comment: 17 pages, 5 figures

Quantifying axon and myelin properties (e.g., axon diameter, myelin thickness, g-ratio) in histology images can provide useful information about microstructural changes caused by neurodegenerative diseases. Automatic tissue segmentation is an important tool for these datasets, as a single stained section can contain up to thousands of axons. Advances in deep learning have made this task quick and reliable with minimal overhead, but a deep learning model trained by one research group will hardly ever be usable by other groups due to differences in their histology training data. This is partly due to subject diversity (different body parts, species, genetics, pathologies) and also to the range of modern microscopy imaging techniques resulting in a wide variability of image features (i.e., contrast, resolution). There is a pressing need to make AI accessible to neuroscience researchers to facilitate and accelerate their workflow, but publicly available models are scarce and poorly maintained. Our approach is to aggregate data from multiple imaging modalities (bright field, electron microscopy, Raman spectroscopy) and species (mouse, rat, rabbit, human), to create an open-source, durable tool for axon and myelin segmentation. Our generalist model makes it easier for researchers to process their data and can be fine-tuned for better performance on specific domains. We study the benefits of different aggregation schemes. This multi-domain segmentation model performs better than single-modality dedicated learners (p=0.03077), generalizes better on out-of-distribution data and is easier to use and maintain. Importantly, we package the segmentation tool into a well-maintained open-source software ecosystem (see https://github.com/axondeepseg/axondeepseg)., Comment: 12 pages, 8 figures

Enriching datasets with demographic information, such as gender, race, and age from names, is a critical task in fields like healthcare, public policy, and social sciences. Such demographic insights allow for more precise and effective engagement with target populations. Despite previous efforts employing hidden Markov models and recurrent neural networks to predict demographics from names, significant limitations persist: the lack of large-scale, well-curated, unbiased, publicly available datasets, and the lack of an approach robust across datasets. This scarcity has hindered the development of traditional supervised learning approaches. In this paper, we demonstrate that the zero-shot capabilities of Large Language Models (LLMs) can perform as well as, if not better than, bespoke models trained on specialized data. We apply these LLMs to a variety of datasets, including a real-life, unlabelled dataset of licensed financial professionals in Hong Kong, and critically assess the inherent demographic biases in these models. Our work not only advances the state-of-the-art in demographic enrichment but also opens avenues for future research in mitigating biases in LLMs., Comment: 8 pages, 7 Tables, 5 Figures

In this article, we focus on the communication costs of three symmetric matrix computations: i) multiplying a matrix with its transpose, known as a symmetric rank-k update (SYRK) ii) adding the result of the multiplication of a matrix with the transpose of another matrix and the transpose of that result, known as a symmetric rank-2k update (SYR2K) iii) performing matrix multiplication with a symmetric input matrix (SYMM). All three computations appear in the Level 3 Basic Linear Algebra Subroutines (BLAS) and have wide use in applications involving symmetric matrices. We establish communication lower bounds for these kernels using sequential and distributed-memory parallel computational models, and we show that our bounds are tight by presenting communication-optimal algorithms for each setting. Our lower bound proofs rely on applying a geometric inequality for symmetric computations and analytically solving constrained nonlinear optimization problems. The symmetric matrix and its corresponding computations are accessed and performed according to a triangular block partitioning scheme in the optimal algorithms., Comment: 43 pages, 6 figures. To be published in ACM Transactions on Parallel Computing

The $\mathrm{U}(1)$ Chern-Simons theory can be extended to a topological $\mathrm{U}(1)^n$ theory by taking a combination of Chern-Simons and BF actions, the mixing being achieved with the help of a collection of integer coupling constants. Based on the Deligne-Beilinson cohomology, a partition function can then be computed for such a $\mathrm{U}(1)^n$ Chern-Simons theory. This partition function is clearly a topological invariant of the closed oriented $3$-manifold on which the theory is defined. Then, by applying a reciprocity formula a new expression of this invariant is obtained which should be a Reshetikhin-Turaev invariant. Finally, a duality between $\mathrm{U}(1)^n$ Chern-Simons theories is demonstrated., Comment: 38 pages, 2 figures

Context: New spectroscopic surveys will increase the number of astronomical objects requiring characterization by over tenfold.. Machine learning tools are required to address this data deluge in a fast and accurate fashion. Most machine learning algorithms can not estimate error directly, making them unsuitable for reliable science. Aims: We aim to train a supervised deep-learning algorithm tailored for high-resolution observational stellar spectra. This algorithm accurately infer precise estimates while providing coherent estimates of uncertainties by leveraging information from both the neural network and the spectra. Methods: We train a conditional Invertible Neural Network (cINN) on observational spectroscopic data obtained from the GIRAFFE spectrograph (HR10 and HR21 setups) within the Gaia-ESO survey. A key features of cINN is its ability to produce the Bayesian posterior distribution of parameters for each spectrum. By analyzing this distribution, we inferred parameters and their uncertainties. Several tests have been applied to study how parameters and errors are estimated. Results: We achieved an accuracy of 28K in $T_{\text{eff}}$, 0.06 dex in $\log g$, 0.03 dex in $[\text{Fe/H}]$, and between 0.05 dex and 0.17 dex for the other abundances for high quality spectra. Accuracy remains stable with low signal-to-noise ratio spectra. The uncertainties obtained are well within the same order of magnitude. The network accurately reproduces astrophysical relationships both on the scale of the Milky Way and within smaller star clusters. We created a table containing the new parameters generated by our cINN. Conclusion: This neural network represents a compelling proposition for future astronomical surveys. These coherent derived uncertainties make it possible to reuse these estimates in other works as Bayesian priors and thus present a solid basis for future work., Comment: Accepted for publication in A&A

Archaeological sites are the physical remains of past human activity and one of the main sources of information about past societies and cultures. However, they are also the target of malevolent human actions, especially in countries having experienced inner turmoil and conflicts. Because monitoring these sites from space is a key step towards their preservation, we introduce the DAFA Looted Sites dataset, \datasetname, a labeled multi-temporal remote sensing dataset containing 55,480 images acquired monthly over 8 years across 675 Afghan archaeological sites, including 135 sites looted during the acquisition period. \datasetname~is particularly challenging because of the limited number of training samples, the class imbalance, the weak binary annotations only available at the level of the time series, and the subtlety of relevant changes coupled with important irrelevant ones over a long time period. It is also an interesting playground to assess the performance of satellite image time series (SITS) classification methods on a real and important use case. We evaluate a large set of baselines, outline the substantial benefits of using foundation models and show the additional boost that can be provided by using complete time series instead of using a single image.

The construction of general amplitudes satisfying symmetries and $S$-matrix constraints has been the primary tool in studying the spectrum of hadrons for over half a century. In this work, we present a new parameterization, which can fulfill many expectations of $S$-matrix and Regge theory and connects the essential physics of hadron scattering in the resonance region and in asymptotic limits. In this construction, dynamical information is entirely contained in Regge trajectories that generalize resonance poles in the complex energy plane to moving poles in the angular momentum plane. We highlight the salient features of the model, compare with existing literature on dispersive and dual amplitudes, and benchmark the formalism with an initial numerical application to the $\rho$ and $\sigma/f_0(500)$ mesons in $\pi\pi$ scattering., Comment: 27 pages, 10 figures

We consider a state-space model (SSM) parametrized by some parameter $\theta$ and aim at performing joint parameter and state inference. A popular idea to carry out this task is to replace $\theta$ by a Markov chain $(\theta_t)_{t\geq 0}$ and then to apply a filtering algorithm to the extended, or self-organizing SSM (SO-SSM). However, the practical implementation of this idea in a theoretically justified way has remained an open problem. In this paper we fill this gap by introducing constructions of $(\theta_t)_{t\geq 0}$ that ensure the validity of the SO-SSM for joint parameter and state inference. Notably, we show that such SO-SSMs can be defined even if $\|\mathrm{Var}(\theta_{t}|\theta_{t-1})\|\rightarrow 0$ slowly as $t\rightarrow\infty$. This result is important since these models can be efficiently approximated using a particle filter. While SO-SSMs have been introduced for online inference, the development of iterated filtering (IF) has shown that they can also serve for computing the maximum likelihood estimator of an SSM. We also derive constructions of $(\theta_t)_{t\geq 0}$ and theoretical guarantees tailored to these specific applications of SO-SSMs and introduce new IF algorithms. From a practical point of view, the algorithms we develop are simple to implement and only require minimal tuning to perform well., Comment: 102 pages (28 pages for the paper, 6 for the appendix and 68 for the supplementary material), 4 figures

Semiconductor quantum dots are a versatile source of single photons with tunable properties to be used in quantum-cryptographic applications. A crucial figure of merit of the emitted photons is photon number coherence (PNC), which impacts the security of many quantum communication protocols. In the process of single-photon generation, the quantum dot as a solid-state object is subject to an interaction with phonons, which can therefore indirectly affect the PNC. In this paper, we elaborate on the origin of PNC in optically excited quantum dots and how it is affected by phonons. In contrast to the expectation that phonons always deteriorate coherence, PNC can be increased in a quantum dot-cavity system due to the electron-phonon interaction.

We provide the first counter-example showing that the ground state energy of electrons in an external Coulomb potential is not always a convex function of the number of electrons. This property had been conjectured to hold for decades and it plays an important role in quantum chemistry. Our counter-example involves an external potential generated by six nuclei of small fractional charges, placed far away from each other. The ground state energy of 3 electrons is proved to be higher than the average of the energies for 2 and 4 electrons. In addition, we show that the nuclei can bind 2 or 4 electrons, but not 3. Although the conjecture remains open for real nuclei (of integer charges), our work sets some doubt on the validity of the energy convexity for general atoms and molecules., Comment: This paper is dedicated to Trygve Helgaker on the occasion of his 70th birthday

In a regular mean field game (MFG), the agents are assumed to be insignificant, they do not realize their effect on the population level and this may result in a phenomenon coined as the Tragedy of the Commons by the economists. However, in real life this phenomenon is often avoided thanks to the underlying altruistic behavior of (all or some of the) agents. Motivated by this observation, we introduce and analyze two different mean field models to include altruism in the decision making of agents. In the first model, mixed individual MFGs, there are infinitely many agents who are partially altruistic (i.e., they behave partially cooperatively) and partially non-cooperative. In the second model, mixed population MFGs, one part of the population behaves cooperatively and the remaining agents behave non-cooperatively. Both models are introduced in a general linear quadratic framework for which we characterize the equilibrium via forward backward stochastic differential equations. Furthermore, we give explicit solutions in terms of ordinary differential equations, and prove the existence and uniqueness results., Comment: 7 pages, accepted at CDC 2024

The integration of renewable energy sources (RES) into power grids presents significant challenges due to their intrinsic stochasticity and uncertainty, necessitating the development of new techniques for reliable and efficient forecasting. This paper proposes a method combining probabilistic forecasting and Gaussian copula for day-ahead prediction and scenario generation of load, wind, and solar power in high-dimensional contexts. By incorporating weather covariates and restoring spatio-temporal correlations, the proposed method enhances the reliability of probabilistic forecasts in RES. Extensive numerical experiments compare the effectiveness of different time series models, with performance evaluated using comprehensive metrics on a real-world and high-dimensional dataset from Midcontinent Independent System Operator (MISO). The results highlight the importance of weather information and demonstrate the efficacy of the Gaussian copula in generating realistic scenarios, with the proposed weather-informed Temporal Fusion Transformer (WI-TFT) model showing superior performance.

Saliency prediction models are constrained by the limited diversity and quantity of labeled data. Standard data augmentation techniques such as rotating and cropping alter scene composition, affecting saliency. We propose a novel data augmentation method for deep saliency prediction that edits natural images while preserving the complexity and variability of real-world scenes. Since saliency depends on high-level and low-level features, our approach involves learning both by incorporating photometric and semantic attributes such as color, contrast, brightness, and class. To that end, we introduce a saliency-guided cross-attention mechanism that enables targeted edits on the photometric properties, thereby enhancing saliency within specific image regions. Experimental results show that our data augmentation method consistently improves the performance of various saliency models. Moreover, leveraging the augmentation features for saliency prediction yields superior performance on publicly available saliency benchmarks. Our predictions align closely with human visual attention patterns in the edited images, as validated by a user study., Comment: 18 pages, published in ECCV 2024

In the framework of the optimal wave energy absorption, we solve theoretically and numerically a parametric shape optimization problem to find the optimal distribution of absorbing material in the reflexive one defined by a characteristic function in the Robin-type boundary condition associated with the Helmholtz equation. Robin boundary condition can be given on a part or the all boundary of a bounded ($\epsilon$, $\infty$)-domain of R n . The geometry of the partially absorbing boundary is fixed, but allowed to be non-Lipschitz, for example, fractal. It is defined as the support of a d-upper regular measure with d $\in$]n -2, n[. Using the well-posedness properties of the model, for any fixed volume fraction of the absorbing material, we establish the existence of at least one optimal distribution minimizing the acoustical energy on a fixed frequency range of the relaxation problem. Thanks to the shape derivative of the energy functional, also existing for non-Lipschitz boundaries, we implement (in the two-dimensional case) the gradient descent method and find the optimal distribution with 50% of the absorbent material on a frequency range with better performances than the 100% absorbent boundary. The same type of performance is also obtained by the genetic method.

Recently, diffusion-based generative models have demonstrated remarkable performance in speech enhancement tasks. However, these methods still encounter challenges, including the lack of structural information and poor performance in low Signal-to-Noise Ratio (SNR) scenarios. To overcome these challenges, we propose the Schr\"oodinger Bridge-based Speech Enhancement (SBSE) method, which learns the diffusion processes directly between the noisy input and the clean distribution, unlike conventional diffusion-based speech enhancement systems that learn data to Gaussian distributions. To enhance performance in extremely noisy conditions, we introduce a two-stage system incorporating ratio mask information into the diffusion-based generative model. Our experimental results show that our proposed SBSE method outperforms all the baseline models and achieves state-of-the-art performance, especially in low SNR conditions. Importantly, only a few inference steps are required to achieve the best result.

We present cogsworth, an open-source Python tool for producing self-consistent population synthesis and galactic dynamics simulations. With cogsworth one can (1) sample a population of binaries and star formation history, (2) perform rapid (binary) stellar evolution, (3) integrate orbits through the galaxy and (4) inspect the full evolutionary history of each star or compact object, as well as their positions and kinematics. We include the functionality for post-processing hydrodynamical zoom-in simulations as a basis for galactic potentials and star formation histories to better account for initial spatial stellar clustering and more complex potentials. Alternatively, several analytic models are available for both the potential and star formation history. cogsworth can transform the intrinsic simulated population to an observed population through the joint application of dust maps, bolometric correction functions and survey selection functions. We provide a detailed explanation of the functionality of cogsworth and demonstrate its capabilities through a series of use cases: (1) We predict the spatial distribution of compact objects and runaways in both dwarf and Milky-Way-like galaxies, (2) using a star cluster from a hydrodynamical simulation, we show how supernovae can change the orbits of stars in several ways, and (3) we predict the separation of disrupted binary stellar companions on the sky and create a synthetic Gaia colour-magnitude diagram. We also discuss some current limitations and plans for future developments. We designed cogsworth and its online documentation to provide a powerful tool for constraining binary evolution, but also a flexible and accessible resource for the entire community., Comment: 15 pages, 9 figures. Accepted in ApJS. Documentation at https://cogsworth.readthedocs.io

Domain adaptation is a widely used method in natural language processing (NLP) to improve the performance of a language model within a specific domain. This method is particularly common in the biomedical domain, which sees regular publication of numerous scientific articles. PubMed, a significant corpus of text, is frequently used in the biomedical domain. The primary objective of this study is to explore whether refining a pre-training dataset using specific quality metrics for scientific papers can enhance the performance of the resulting model. To accomplish this, we employ two straightforward journal impact metrics and conduct experiments by continually pre-training BERT on various subsets of the complete PubMed training set, we then evaluate the resulting models on biomedical language understanding tasks from the BLURB benchmark. Our results show that pruning using journal impact metrics is not efficient. But we also show that pre-training using fewer abstracts (but with the same number of training steps) does not necessarily decrease the resulting model's performance.

This paper is devoted to the study of the nonlinear Schr\"odinger-Poisson system with a doping profile. We are interested in the existence of stable standing waves by considering the associated $L^2$-minimization problem. The presence of a doping profile causes a difficulty in the proof of the strict sub-additivity. A key ingredient is to establish the strict sub-additivity by adapting a scaling and an iteration argument, which is inspired by \cite{ZZou}. When the doping profile is a characteristic function supported on a bounded smooth domain, smallness of some geometric quantity related to the domain ensures the existence of stable standing waves.

This article presents a new approach based on MiniRocket, called SelF-Rocket, for fast time series classification (TSC). Unlike existing approaches based on random convolution kernels, it dynamically selects the best couple of input representations and pooling operator during the training process. SelF-Rocket achieves state-of-the-art accuracy on the University of California Riverside (UCR) TSC benchmark datasets.

The text mining method presented in this paper was used for annotation of terms related to biological transformation and valorization of organic residues in agriculture in low and middle-income country. Specialized lexicon was obtained through different steps: corpus and extraction of terms, annotation of extracted terms, selection of relevant terms., Comment: 5 pages, 2 tables

We present a modified approach to laser optical-feedback cavity-enhanced absorption spectroscopy. The technique involves continuously scanning the length of a high-finesse cavity to periodically lock a diode laser to the cavity resonance, resulting in a discrete set of transmission measurements that are evenly spaced in frequency. For a fixed laser bias, data can be collected spanning a spectral bandwidth equivalent to the free-spectral range of the cavity, with spectral resolution inversely proportional to the distance from the laser to cavity. The center frequency of this scan can be tuned by tuning the free-running laser frequency. We demonstrate the concept using a fiber-coupled 1578-nm laser and a scanning Fabry-Perot cavity to measure a series of weak CO2 absorption lines with a frequency resolution of 15.6 MHz and a noise equivalent absorption coefficient of 10-7 cm-1, limited by the moderate finesse (~5000) and short length (~5 cm) of the cavity. Individual CO2 line shapes can be measured with high resolution in a single scan that takes 67 ms. The approach has a combination of characteristics that are advantageous for in situ instruments, such as small size, high spectral resolution, fast data collection, and minimal components.

Multi-fidelity surrogate models combining dimensionality reduction and an intermediate surrogate in the reduced space allow a cost-effective emulation of simulators with functional outputs. The surrogate is an input-output mapping learned from a limited number of simulator evaluations. This computational efficiency makes surrogates commonly used for many-query tasks. Diverse methods for building them have been proposed in the literature, but they have only been partially compared. This paper introduces a unified framework encompassing the different surrogate families, followed by a methodological comparison and the exposition of practical considerations. More than a dozen of existing multi-fidelity surrogates have been implemented under the unified framework and evaluated on a set of benchmark problems. Based on the results, guidelines and recommendations are proposed regarding multi-fidelity surrogates with functional outputs. Our study shows that most multi-fidelity surrogates outperform their tested single-fidelity counterparts under the considered settings. But no particular surrogate is performing better on every test case. Therefore, the selection of a surrogate should consider the specific properties of the emulated functions, in particular the correlation between the low- and high-fidelity simulators, the size of the training set, the local nonlinear variations in the residual fields, and the size of the training datasets.

Precise wave manipulation has undoubtedly forged the technological landscape we thrive in today. Although our understanding of wave phenomena has come a long way since the earliest observations of desert dunes or ocean waves, the unimpeded development of mathematics has enabled ever more complex and exotic physical phenomena to be comprehensively described. Here, we take wave manipulation a step further by introducing an unprecedented synthetic acoustic crystal capable of realizing simultaneous linear broadband conduction and nonlinear topological insulation, depicting a robust amplitude-dependent mode localized deep within - i.e. an amplitude-driven topological confinement of sound. The latter is achieved by means of an open acoustic waveguide lined with a chain of nonlocally and nonlinearly coupled active electroacoustic resonators. Starting from a comprehensive topological model for classical waves, we demonstrate that different topological regimes can be accessed by increasing driving amplitude and that topological robustness against coupling disorder is a direct consequence of symmetric and simultaneous response between coupled resonators. Theoretical predictions are validated by a fully programmable experimental apparatus capable of realizing the real-time manipulation of metacrystal properties. In all, our results provide a solid foundation for future research in the design and manipulation of classical waves in artificial materials involving nonlinearity, nonlocality, and non-hermiticity.

Laser spectroscopy and interferometry have provided an unparalleled view into the fundamental nature of matter and the universe through ultra-precise measurements of atomic transition frequencies and gravitational waves. Optical frequency combs have expanded metrology capabilities by phase-coherently bridging radio frequency and optical domains to enable traceable high-resolution spectroscopy across bandwidths greater than hundreds of terahertz. However, quantum mechanics limits the measurement precision achievable with laser frequency combs and traditional laser sources, ultimately impacting fundamental interferometry and spectroscopy. Squeezing the distribution of quantum noise to enhance measurement precision of either the amplitude or phase quadrature of an optical field leads to significant measurement improvements with continuous wave lasers. In this work, we generate bright amplitude-squeezed frequency comb light and apply it to molecular spectroscopy using interferometry that leverages the high-speed and broad spectral coverage of the dual-comb technique. Using the Kerr effect in nonlinear optical fiber, the amplitude quadrature of a frequency comb centered at 1560 nm is squeezed by >3 dB over a 2.5 THz of bandwidth that includes 2500 comb teeth spaced by 1 GHz. Interferometry with a second coherent state frequency comb yields mode-resolved spectroscopy of hydrogen sulfide gas with a signal-to-noise ratio (SNR) nearly 3 dB beyond the shot noise limit, taking full metrological advantage of the amplitude squeezing when the electrical noise floor is considered. The quantum noise reduction leads to a two-fold quantum speedup in the determination of gas concentration, with impact for fast, broadband, and high SNR ratio measurements of multiple species in dynamic chemical environments., Comment: 31 pages, 12 figures

Numerous biological and physical processes can be modeled as systems of interacting entities evolving continuously over time, e.g. the dynamics of communicating cells or physical particles. Learning the dynamics of such systems is essential for predicting the temporal evolution of populations across novel samples and unseen environments. Flow-based models allow for learning these dynamics at the population level - they model the evolution of the entire distribution of samples. However, current flow-based models are limited to a single initial population and a set of predefined conditions which describe different dynamics. We argue that multiple processes in natural sciences have to be represented as vector fields on the Wasserstein manifold of probability densities. That is, the change of the population at any moment in time depends on the population itself due to the interactions between samples. In particular, this is crucial for personalized medicine where the development of diseases and their respective treatment response depends on the microenvironment of cells specific to each patient. We propose Meta Flow Matching (MFM), a practical approach to integrating along these vector fields on the Wasserstein manifold by amortizing the flow model over the initial populations. Namely, we embed the population of samples using a Graph Neural Network (GNN) and use these embeddings to train a Flow Matching model. This gives MFM the ability to generalize over the initial distributions unlike previously proposed methods. We demonstrate the ability of MFM to improve prediction of individual treatment responses on a large scale multi-patient single-cell drug screen dataset.

The Fukushima-Daiichi release of radioactivity is a relevant event to study the atmospheric dispersion modelling of radionuclides. Actually, the atmospheric deposition onto the ground may be studied through the map of measured Cs-137 established consecutively to the accident. The limits of detection were low enough to make the measurements possible as far as 250km from the nuclear power plant. This large scale deposition has been modelled with the Eulerian model ldX. However, several weeks of emissions in multiple weather conditions make it a real challenge. Besides, these measurements are accumulated deposition of Cs-137 over the whole period and do not inform of deposition mechanisms involved: in-cloud, below-cloud, dry deposition. In a previous study (Qu{\'e}rel et al., 2016), a comprehensive sensitivity analysis was performed in order to understand wet deposition mechanisms. It has been shown that the choice of the wet deposition scheme has a strong impact on assessment of deposition patterns. Nevertheless, a ``best'' scheme could not be highlighted as it depends on the selected criteria: the ranking differs according to the statistical indicators considered (correlation, figure of merit in space and factor 2). A possibility to explain the difficulty to discriminate between several schemes was the uncertainties in the modelling, resulting from the meteorological data for instance. Since the move of the plume is not properly modelled, the deposition processes are applied with an inaccurate activity concentration in the air. In the framework of the SAKURA project, an MRI-IRSN collaboration, new meteorological fields at higher resolution (Sekiyama et al., 2013) were provided and allow to reconsider the previous study. An update including these new meteorology data is presented. In addition, the focus is put on the deposition schemes commonly used in nuclear emergency context.

Defining script types and establishing classification criteria for medieval handwriting is a central aspect of palaeographical analysis. However, existing typologies often encounter methodological challenges, such as descriptive limitations and subjective criteria. We propose an interpretable deep learning-based approach to morphological script type analysis, which enables systematic and objective analysis and contributes to bridging the gap between qualitative observations and quantitative measurements. More precisely, we adapt a deep instance segmentation method to learn comparable character prototypes, representative of letter morphology, and provide qualitative and quantitative tools for their comparison and analysis. We demonstrate our approach by applying it to the Textualis Formata script type and its two subtypes formalized by A. Derolez: Northern and Southern Textualis, Comment: Accepted at ICDAR 2024 Workshop on Computational Paleography (IWCP, 31 August - Athens, Greece)

We study how to distribute trace languages in a setting where processes communicate via reconfigurable communication channels. That is, the different processes can connect and disconnect from channels at run time. We restrict attention to communication via tree-like communication architectures. These allow channels to connect more than two processes in a way that maintains an underlying spanning tree and keeps communication continuous on the tree. We make the reconfiguration explicit in the language allowing both a centralized automaton as well as the distributed processes to share relevant information about the current communication configuration. We show that Zielonka's seminal result regarding distribution of regular languages for asynchronous automata can be generalized in this setting, incorporating both reconfiguration and more than binary tree architectures.

This paper discusses recent advancements made in the fast prediction of signal power in mmWave communications environments. Using machine learning (ML) it is possible to train models that provide power estimates with both good accuracy and with real-time simulation speeds. Work involving improved training data pre-processing as well as 3D predictions with arbitrary transmitter height is discussed., Comment: 2022 IEEE International Symposium on Antennas and Propagation and USNC-URSI Radio Science Meeting (AP-S/URSI)

This paper aims to develop the study of historical printed ornaments with modern unsupervised computer vision. We highlight three complex tasks that are of critical interest to book historians: clustering, element discovery, and unsupervised change localization. For each of these tasks, we introduce an evaluation benchmark, and we adapt and evaluate state-of-the-art models. Our Rey's Ornaments dataset is designed to be a representative example of a set of ornaments historians would be interested in. It focuses on an XVIIIth century bookseller, Marc-Michel Rey, providing a consistent set of ornaments with a wide diversity and representative challenges. Our results highlight the limitations of state-of-the-art models when faced with real data and show simple baselines such as k-means or congealing can outperform more sophisticated approaches on such data. Our dataset and code can be found at https://printed-ornaments.github.io/.

We explore a novel variant of the classical prophet inequality problem, where the values of a sequence of items are drawn i.i.d. from some distribution, and an online decision maker must select one item irrevocably. We establish that the competitive ratio between the expected optimal performance of the online decision maker compared to that of a prophet, who uses the average of the top $\ell$ items, must be greater than $\ell/c_{\ell}$, with $c_{\ell}$ the solution to an integral equation. We prove that this lower bound is larger than $1-1/(\exp(\ell)-1)$. This implies that the bound converges exponentially fast to $1$ as $\ell$ grows. In particular, the bound for $\ell=2$ is $2/c_{2} \approx 0.966$ which is much closer to $1$ than the classical bound of $0.745$ for $\ell=1$. Additionally, the proposed algorithm can be extended to a more general scenario, where the decision maker is permitted to select $k$ items. This subsumes the $k$ multi-unit i.i.d. prophet problem and provides the current best asymptotic guarantees, as well as enables broader understanding in the more general framework. Finally, we prove a nearly tight competitive ratio when only static threshold policies are allowed.

Material responses to static and dynamic stimuli, represented as nonlinear curves, are design targets for engineering functionalities like structural support, impact protection, and acoustic and photonic bandgaps. Three-dimensional metamaterials offer significant tunability due to their internal structure, yet existing methods struggle to capture their complex behavior-to-structure relationships. We present GraphMetaMat, a graph-based framework capable of designing three-dimensional metamaterials with programmable responses and arbitrary manufacturing constraints. Integrating graph networks, physics biases, reinforcement learning, and tree search, GraphMetaMat can target stress-strain curves spanning four orders of magnitude and complex behaviors, as well as viscoelastic transmission responses with varying attenuation gaps. GraphMetaMat can create cushioning materials for protective equipment and vibration-damping panels for electric vehicles, outperforming commercial materials, and enabling the automatic design of materials with on-demand functionalities., Comment: 19 pages, 5 figures