Miracle-dz/UniFAR-FTUs huggingface dataset:
Optimal portfolio allocation with uncertain covariance matrix

In this paper, we explore the portfolio allocation problem involving an uncertain covariance matrix. We calculate the expected value of the Constant Absolute Risk Aversion (CARA) utility function, marginalized over a distribution of covariance matrices. We show that marginalization introduces a logarithmic dependence on risk, as opposed to the linear dependence assumed in the mean-variance approach. Additionally, it leads to a decrease in the allocation level for higher uncertainties. Our proposed method extends the mean-variance approach by considering the uncertainty associated with future covariance matrices and expected returns, which is important for practical applications.
Conversational Data Exploration: A Game-Changer for Designing Data Science Pipelines

This paper proposes a conversational approach implemented by the system Chatin for driving an intuitive data exploration experience. Our work aims to unlock the full potential of data analytics and artificial intelligence with a new generation of data science solutions. Chatin is a cutting-edge tool that democratises access to AI-driven solutions, empowering non-technical users from various disciplines to explore data and extract knowledge from it.
SL(2, $\mathbb C$) quartic vertex for closed string field theory

We construct the $\mathrm{SL}(2, \mathbb C)$ quartic vertex with a generic stub parameter for the bosonic closed string field theory by characterizing the vertex region in the moduli space of 4-punctured sphere, and providing the necessary and sufficient constraints for the local coordinate maps. While $\mathrm{SL}(2, \mathbb C)$ vertices are not known to have a nice geometric recursive construction like the minimal area or hyperbolic vertices, they can be studied analytically which makes them more convenient for simple computations. In particular, we obtain exact formulas for the parametrization and volume of the vertex region as a function of the stub parameter. The main objective of having an explicit quartic vertex is to later study its decomposition using auxiliary fields.
The Power of Bidiagonal Matrices

Bidiagonal matrices are widespread in numerical linear algebra, not least because of their use in the standard algorithm for computing the singular value decomposition and their appearance as LU factors of tridiagonal matrices. We show that bidiagonal matrices have a number of interesting properties that make them powerful tools in a variety of problems, especially when they are multiplied together. We show that the inverse of a product of bidiagonal matrices is insensitive to small componentwise relative perturbations in the factors if the factors or their inverses are nonnegative. We derive componentwise rounding error bounds for the solution of a linear system $Ax = b$, where $A$ or $A^{-1}$ is a product $B_1 B_2\dots B_k$ of bidiagonal matrices, showing that strong results are obtained when the $B_i$ are nonnegative or have a checkerboard sign pattern. We show that given the \fact\ of an $n\times n$ totally nonnegative matrix $A$ into the product of bidiagonal matrices, $\|A^{-1}\|_{\infty}$ can be computed in $O(n^2)$ flops and that in floating-point arithmetic the computed result has small relative error, no matter how large $\|A^{-1}\|_{\infty}$ is. We also show how factorizations involving bidiagonal matrices of some special matrices, such as the Frank matrix and the Kac--Murdock--Szeg\"o matrix, yield simple proofs of the total nonnegativity and other properties of these matrices.
Controllable Topic-Focused Abstractive Summarization

Controlled abstractive summarization focuses on producing condensed versions of a source article to cover specific aspects by shifting the distribution of generated text towards a desired style, e.g., a set of topics. Subsequently, the resulting summaries may be tailored to user-defined requirements. This paper presents a new Transformer-based architecture capable of producing topic-focused summaries. The architecture modifies the cross-attention mechanism of the Transformer to bring topic-focus control to the generation process while not adding any further parameters to the model. We show that our model sets a new state of the art on the NEWTS dataset in terms of topic-focused abstractive summarization as well as a topic-prevalence score. Moreover, we show via extensive experiments that our proposed topical cross-attention mechanism can be plugged into various Transformer models, such as BART and T5, improving their performance on the CNN/Dailymail and XSum benchmark datasets for abstractive summarization. This is achieved via fine-tuning, without requiring training from scratch. Finally, we show through human evaluation that our model generates more faithful summaries outperforming the state-of-the-art Frost model.
Robust Probabilistic Prediction for Stochastic Dynamical Systems

It is critical and challenging to design robust predictors for stochastic dynamical systems (SDSs) with uncertainty quantification (UQ) in the prediction. Specifically, robustness guarantees the worst-case performance when the predictor's information set of the system is inadequate, and UQ characterizes how confident the predictor is about the predictions. However, it is difficult for traditional robust predictors to provide robust UQ because they were designed to robustify the performance of point predictions. In this paper, we investigate how to robustify the probabilistic prediction for SDS, which can inherently provide robust distributional UQ. To characterize the performance of probabilistic predictors, we generalize the concept of likelihood function to likelihood functional, and prove that this metric is a proper scoring rule. Based on this metric, we propose a framework to quantify when the predictor is robust and analyze how the information set affects the robustness. Our framework makes it possible to design robust probabilistic predictors by solving functional optimization problems concerning different information sets. In particular, we design a class of moment-based optimal robust probabilistic predictors and provide a practical Kalman-filter-based algorithm for implementation. Extensive numerical simulations are provided to elaborate on our results.
Virtual invariants of critical loci in GIT quotients of linear spaces

We use an equivariant version of the localization formula of Jeffrey and Kirwan to prove a formula for virtual invariants $(\text{DT}$, $\chi_y$, $\text{Ell})$ of critical loci in quotients of linear spaces by actions of reductive algebraic groups. In particular we recover formulae for the invariants of critical loci of potentials in moduli spaces of quiver representations predicted by physicists.
Simple and Effective Input Reformulations for Translation

Foundation language models learn from their finetuning input context in different ways. In this paper, we reformulate inputs during finetuning for challenging translation tasks, leveraging model strengths from pretraining in novel ways to improve downstream performance. These reformulations are simple data level modifications, require no additional collection of training data or modification of data at inference time. They can be applied either on single language pair translation tasks or massively multilingual translation tasks. Experiments with these techniques demonstrate significant performance improvements up to $\textbf{3.5 chrF++ on the Flores200 translation benchmark}$. We hope our research accessibly improves finetuning data efficiency, enabling more effective training to scalably improve state-of-the-art performance. Our code is released $\href{https://github.com/bri25yu/LanguageModelExperimentation}{here}. $
NewsGPT: ChatGPT Integration for Robot-Reporter

The integration of large language models (LLMs) with social robots has emerged as a promising avenue for enhancing human-robot interactions at a time when news reports generated by artificial intelligence (AI) are gaining in credibility. This integration is expected to intensify and become a more productive resource for journalism, media, communication, and education. In this paper a novel system is proposed that integrates AI's generative pretrained transformer (GPT) model with the Pepper robot, with the aim of improving the robot's natural language understanding and response generation capabilities for enhanced social interactions. By leveraging GPT's powerful language processing capabilities, this system offers a comprehensive pipeline that incorporates voice input recording, speech-to-text transcription, context analysis, and text-to-speech synthesis action generation. The Pepper robot is enabled to comprehend user queries, generate informative responses with general knowledge, maintain contextually relevant conversations, and act as a more domain-oriented news reporter. It is also linked with a news resource and powered with a Google search capability. To evaluate the performance of the framework, experiments were conducted involving a set of diverse questions. The robot's responses were assessed on the basis of eight criteria, including relevance, context, and fluency. Despite some identified limitations, this system contributes to the field of journalism and human-robot interaction by showcasing the potential of integrating LLMs with social robots. The proposed framework opens up opportunities for improving the conversational capabilities of robots, enabling interactions that are smoother, more engaging, and more context aware.
Heuristic Optimal Transport in Branching Networks

Optimal transport aims to learn a mapping of sources to targets by minimizing the cost, which is typically defined as a function of distance. The solution to this problem consists of straight line segments optimally connecting sources to targets, and it does not exhibit branching. These optimal solutions are in stark contrast with both natural, and man-made transportation networks, where branching structures are prevalent. Here we discuss a fast heuristic branching method for optimal transport in networks. We also provide several numerical applications to synthetic examples, a simplified cardiovascular network, and the"Santa Claus"distribution network which includes 141,182 cities around the world, with known location and population.
Maximum Flow on Highly Dynamic Graphs

Recent advances in dynamic graph processing have enabled the analysis of highly dynamic graphs with change at rates as high as millions of edge changes per second. Solutions in this domain, however, have been demonstrated only for relatively simple algorithms like PageRank, breadth-first search, and connected components. Expanding beyond this, we explore the maximum flow problem, a fundamental, yet more complex problem, in graph analytics. We propose a novel, distributed algorithm for max-flow on dynamic graphs, and implement it on top of an asynchronous vertex-centric abstraction. We show that our algorithm can process both additions and deletions of vertices and edges efficiently at scale on fast-evolving graphs, and provide a comprehensive analysis by evaluating, in addition to throughput, two criteria that are important when applied to real-world problems: result latency and solution stability.
Strength of minority ties: the role of homophily and group composition in a weighted social network

Homophily describes a fundamental tie-formation mechanism in social networks in which connections between similar nodes occur at a higher rate than among dissimilar ones. In this article, we present an extension of the Weighted Social Network (WSN) model that, under an explicit homophily principle, quantifies the emergence of attribute-dependent properties of a social system. To test our model, we make use of empirical association data of a group of free-ranging spider monkeys in Yucatan, Mexico. Our homophilic WSN model reproduces many of the properties of the empirical association network with statistical significance, specifically, the average weight of sex-dependent interactions (female-female, female-male, male-male), the weight distribution function, as well as many weighted macro properties (node strength, weighted clustering, and weighted number of modules), even for different age group combinations (adults, subadults, and juveniles). Furthermore, by performing simulations with fitted parameters, we show that one of the main features of a spider monkey social system, namely, stronger male-male interactions over female-female or female-male ones, can be accounted for by an asymmetry in the node-type composition of a bipartisan network, independently of group size. The reinforcement of connections among members of minority groups could be a general structuring mechanism in homophilic social networks.
AdaCCD: Adaptive Semantic Contrasts Discovery based Cross Lingual Adaptation for Code Clone Detection

Code Clone Detection, which aims to retrieve functionally similar programs from large code bases, has been attracting increasing attention. Modern software often involves a diverse range of programming languages. However, current code clone detection methods are generally limited to only a few popular programming languages due to insufficient annotated data as well as their own model design constraints. To address these issues, we present AdaCCD, a novel cross-lingual adaptation method that can detect cloned codes in a new language without annotations in that language. AdaCCD leverages language-agnostic code representations from pre-trained programming language models and propose an Adaptively Refined Contrastive Learning framework to transfer knowledge from resource-rich languages to resource-poor languages. We evaluate the cross-lingual adaptation results of AdaCCD by constructing a multilingual code clone detection benchmark consisting of 5 programming languages. AdaCCD achieves significant improvements over other baselines, and achieve comparable performance to supervised fine-tuning.
Incentivizing Investment and Reliability: A Study on Electricity Capacity Markets

The capacity market, a marketplace to exchange available generation capacity for electricity production, provides a major revenue stream for generators and is adopted in several U.S. regions. A subject of ongoing debate, the capacity market is viewed by its proponents as a crucial mechanism to ensure system reliability, while critics highlight its drawbacks such as market distortion. Under a novel analytical framework, we rigorously evaluate the impact of the capacity market on generators' revenue and system reliability. More specifically, based on market designs at New York Independent System Operator (NYISO), we propose market equilibrium-based models to capture salient aspects of the capacity market and its interaction with the energy market. We also develop a leader-follower model to study market power. We show that the capacity market incentivizes the investment of generators with lower net cost of new entry. It also facilitates reliability by preventing significant physical withholding when the demand is relatively high. Nevertheless, the capacity market may not provide enough revenue for peaking plants. Moreover, it is susceptible to market power, which necessitates tailored market power mitigation measures depending on market dynamics. We provide further insights via large-scale experiments on data from NYISO markets.
Visual Commonsense based Heterogeneous Graph Contrastive Learning

How to select relevant key objects and reason about the complex relationships cross vision and linguistic domain are two key issues in many multi-modality applications such as visual question answering (VQA). In this work, we incorporate the visual commonsense information and propose a heterogeneous graph contrastive learning method to better finish the visual reasoning task. Our method is designed as a plug-and-play way, so that it can be quickly and easily combined with a wide range of representative methods. Specifically, our model contains two key components: the Commonsense-based Contrastive Learning and the Graph Relation Network. Using contrastive learning, we guide the model concentrate more on discriminative objects and relevant visual commonsense attributes. Besides, thanks to the introduction of the Graph Relation Network, the model reasons about the correlations between homogeneous edges and the similarities between heterogeneous edges, which makes information transmission more effective. Extensive experiments on four benchmarks show that our method greatly improves seven representative VQA models, demonstrating its effectiveness and generalizability.
The disk of the eruptive protostar V900 Mon. A MATISSE/VLTI and MUSE/VLT perspective

In this work, we study the silicate dust content in the disk of one of the youngest eruptive stars, V900 Mon, at the highest angular resolution, probing down to the inner 10 au of said disk, and study the historical evolution of the system, traced in part by a newly discovered emission clump. We performed high angular resolution MIR interferometric observations of V900 Mon with MATISSE/VLTI with a spatial coverage ranging from 38-m to 130-m baselines, and compared them to archival MIDI/VLTI data. We also mined and re-analyzed archival optical and infrared photometry of the star to study its long-term evolution since its eruption in the 1990s. We complemented our findings with integral field spectroscopy data from MUSE/VLT. The MATISSE/VLTI data suggest a radial variation in the silicate feature in the dusty disk, whereby at large spatial scales ($ au) the protostellar disk's emission is dominated by large-sized ($ silicate grains, while at smaller spatial scales and closer to the star ($ au) silicate emission is absent, suggesting self-shielding. We propose that the self-shielding may be the result of small dust grains at the base of the collimated CO outflow previously detected by ALMA. A newly discovered knot in the MUSE/VLT data, located at a projected distance approximately 27,000 au from the star, is co-aligned with the molecular gas outflow at a P.A. of 250 consistent with the position angle and inclination of the disk. The knot is seen in emission in Halpha N ii and the S II doublet and its kinematic age is about 5150 years. This ejected material could originate from a previous eruption.
Tuning Multipolar Mie Scattering of Particles on a Dielectric-Covered Mirror

Optically resonant particles are key building blocks of many nanophotonic devices such as optical antennas and metasurfaces. Because the functionalities of such devices are largely determined by the optical properties of individual resonators, extending the attainable responses from a given particle is highly desirable. Practically, this is usually achieved by introducing an asymmetric dielectric environment. However, commonly used simple substrates have limited influences on the optical properties of the particles atop. Here, we show that the multipolar scattering of silicon microspheres can be effectively modified by placing the particles on a dielectric-covered mirror, which tunes the coupling between the Mie resonances of microspheres and the standing waves and waveguide modes in the dielectric spacer. This tunability allows selective excitation, enhancement, and suppression of the multipolar resonances and enables scattering at extended wavelengths, providing new opportunities in controlling light-matter interactions for various applications. We further demonstrate with experiments the detection of molecular fingerprints by single-particle mid-infrared spectroscopy, and, with simulations strong optical repulsive forces that could elevate the particles from a substrate.
Broad Sterile Neutrinos&the Reactor/Gallium Tension

Significant evidence exists for the apparent disappearance of electron-type neutrinos in radioactive source experiments. Yet, interpreted within the standard `3+1 sterile neutrino scenario', precision short-baseline measurements of electron antineutrinos from nuclear reactors strongly disagree with these results. Recently, it has been demonstrated that allowing for a finite wavepacket size for the reactor neutrinos can ameliorate such a tension, however the smallness of the required wavepackets is a subject of intense debate. In this work, we demonstrate that a `broad' sterile neutrino may relax this tension in much the same way. Such a phenomenological possibility can arise in plausible hidden sector scenarios, such as a clockwork-style sector, for which we provide a concrete microscopic model.
Optimal finite element approximation of unique continuation

We consider finite element approximations of ill-posed elliptic problems with conditional stability. The notion of {\emph{optimal error estimates}} is defined including both convergence with respect to mesh parameter and perturbations in data. The rate of convergence is determined by the conditional stability of the underlying continuous problem and the polynomial order of the finite element approximation space. A proof is given that no finite element approximation can converge at a better rate than that given by the definition, justifying the concept. A recently introduced class of finite element methods with weakly consistent regularisation is recalled and the associated error estimates are shown to be quasi optimal in the sense of our definition.
BUSSARD - Better Understanding Social Situations for Autonomous Robot Decision-Making

We report on our effort to create a corpus dataset of different social context situations in an office setting for further disciplinary and interdisciplinary research in computer vision, psychology, and human-robot-interaction. For social robots to be able to behave appropriately, they need to be aware of the social context they act in. Consider, for example, a robot with the task to deliver a personal message to a person. If the person is arguing with an office mate at the time of message delivery, it might be more appropriate to delay playing the message as to respect the recipient's privacy and not to interfere with the current situation. This can only be done if the situation is classified correctly and in a second step if an appropriate behavior is chosen that fits the social situation. Our work aims to enable robots accomplishing the task of classifying social situations by creating a dataset composed of semantically annotated video scenes of office situations from television soap operas. The dataset can then serve as a basis for conducting research in both computer vision and human-robot interaction.
Dynamic mode decomposition of nonequilibrium electron-phonon dynamics: accelerating the first-principles real-time Boltzmann equation

Nonequilibrium dynamics governed by electron-phonon (e-ph) interactions plays a key role in electronic devices and spectroscopies and is central to understanding electronic excitations in materials. The real-time Boltzmann transport equation (rt-BTE) with collision processes computed from first principles can describe the coupled dynamics of electrons and atomic vibrations (phonons). Yet, a bottleneck of these simulations is the calculation of e-ph scattering integrals on dense momentum grids at each time step. Here we show a data-driven approach based on dynamic mode decomposition (DMD) that can accelerate the time propagation of the rt-BTE and identify dominant electronic processes. We apply this approach to two case studies, high-field charge transport and ultrafast excited electron relaxation. In both cases, simulating only a short time window of ~10% of the dynamics suffices to predict the dynamics from initial excitation to steady state using DMD extrapolation. Analysis of the momentum-space modes extracted from DMD sheds light on the microscopic mechanisms governing electron relaxation to steady state or equilibrium. The combination of accuracy and efficiency makes our DMD-based method a valuable tool for investigating ultrafast dynamics in a wide range of materials.