Miracle-dz/UniFAR-FTUs huggingface dataset:
Investigation of ensemble methods for the detection of deepfake face manipulations

The recent wave of AI research has enabled a new brand of synthetic media, called deepfakes. Deepfakes have impressive photorealism, which has generated exciting new use cases but also raised serious threats to our increasingly digital world. To mitigate these threats, researchers have tried to come up with new methods for deepfake detection that are more effective than traditional forensics and heavily rely on deep AI technology. In this paper, following up on encouraging prior work for deepfake detection with attribution and ensemble techniques, we explore and compare multiple designs for ensemble detectors. The goal is to achieve robustness and good generalization ability by leveraging ensembles of models that specialize in different manipulation categories. Our results corroborate that ensembles can achieve higher accuracy than individual models when properly tuned, while the generalization ability relies on access to a large number of training data for a diverse set of known manipulations.
PBNR: Prompt-based News Recommender System

Online news platforms often use personalized news recommendation methods to help users discover articles that align with their interests. These methods typically predict a matching score between a user and a candidate article to reflect the user's preference for the article. Some previous works have used language model techniques, such as the attention mechanism, to capture users' interests based on their past behaviors, and to understand the content of articles. However, these existing model architectures require adjustments if additional information is taken into account. Pre-trained large language models, which can better capture word relationships and comprehend contexts, have seen a significant development in recent years, and these pre-trained models have the advantages of transfer learning and reducing the training time for downstream tasks. Meanwhile, prompt learning is a newly developed technique that leverages pre-trained language models by building task-specific guidance for output generations. To leverage textual information in news articles, this paper introduces the pre-trained large language model and prompt-learning to the community of news recommendation. The proposed model"prompt-based news recommendation"(PBNR) treats the personalized news recommendation as a text-to-text language task and designs personalized prompts to adapt to the pre-trained language model -- text-to-text transfer transformer (T5). Experimental studies using the Microsoft News dataset show that PBNR is capable of making accurate recommendations by taking into account various lengths of past behaviors of different users. PBNR can also easily adapt to new information without changing the model architecture and the training objective. Additionally, PBNR can make recommendations based on users' specific requirements, allowing human-computer interaction in the news recommendation field.
Sparse estimation in semiparametric finite mixture of varying coefficient regression models

Finite mixture of regressions (FMR) are commonly used to model heterogeneous effects of covariates on a response variable in settings where there are unknown underlying subpopulations. FMRs, however, cannot accommodate situations where covariates' effects also vary according to an “index” variable—known as finite mixture of varying coefficient regression (FM‐VCR). Although complex, this situation occurs in real data applications: the osteocalcin (OCN) data analyzed in this manuscript presents a heterogeneous relationship where the effect of a genetic variant on OCN in each hidden subpopulation varies over time. Oftentimes, the number of covariates with varying coefficients also presents a challenge: in the OCN study, genetic variants on the same chromosome are considered jointly. The relative proportions of hidden subpopulations may also change over time. Nevertheless, existing methods cannot provide suitable solutions for accommodating all these features in real data applications. To fill this gap, we develop statistical methodologies based on regularized local‐kernel likelihood for simultaneous parameter estimation and variable selection in sparse FM‐VCR models. We study large‐sample properties of the proposed methods. We then carry out a simulation study to evaluate the performance of various penalties adopted for our regularized approach and ascertain the ability of a BIC‐type criterion for estimating the number of subpopulations. Finally, we applied the FM‐VCR model to analyze the OCN data and identified several covariates, including genetic variants, that have age‐dependent effects on OCN.
Deep Explainable Relational Reinforcement Learning: A Neuro-Symbolic Approach

Despite numerous successes in Deep Reinforcement Learning (DRL), the learned policies are not interpretable. Moreover, since DRL does not exploit symbolic relational representations, it has difficulties in coping with structural changes in its environment (such as increasing the number of objects). Relational Reinforcement Learning, on the other hand, inherits the relational representations from symbolic planning to learn reusable policies. However, it has so far been unable to scale up and exploit the power of deep neural networks. We propose Deep Explainable Relational Reinforcement Learning (DERRL), a framework that exploits the best of both -- neural and symbolic worlds. By resorting to a neuro-symbolic approach, DERRL combines relational representations and constraints from symbolic planning with deep learning to extract interpretable policies. These policies are in the form of logical rules that explain how each decision (or action) is arrived at. Through several experiments, in setups like the Countdown Game, Blocks World, Gridworld, and Traffic, we show that the policies learned by DERRL can be applied to different configurations and contexts, hence generalizing to environmental modifications.
Decentralized projected Riemannian gradient method for smooth optimization on compact submanifolds

We consider the problem of decentralized nonconvex optimization over a compact submanifold, where each local agent's objective function defined by the local dataset is smooth. Leveraging the powerful tool of proximal smoothness, we establish local linear convergence of the projected gradient descent method with a unit step size for solving the consensus problem over the nonconvex compact submanifold. This serves as the basis for designing and analyzing decentralized algorithms on manifolds. Subsequently, we propose two decentralized methods: the decentralized projected Riemannian gradient descent (DPRGD) and the decentralized projected Riemannian gradient tracking (DPRGT). We establish their convergence rates of $\mathcal{O}(1/\sqrt{K})$ and $\mathcal{O}(1/K)$, respectively, to reach a stationary point. To the best of our knowledge, DPRGT is the first decentralized algorithm to achieve exact convergence for solving decentralized optimization over a compact submanifold. Beyond the linear convergence results on the consensus, two key tools developed in the proof are the Lipschitz-type inequality of the projection operator and the Riemannian quadratic upper bound for smooth functions on the compact submanifold, which could be of independent interest. Finally, we demonstrate the effectiveness of our proposed methods compared to state-of-the-art ones through numerical experiments on eigenvalue problems and low-rank matrix completion.
VISAR: A Human-AI Argumentative Writing Assistant with Visual Programming and Rapid Draft Prototyping

In argumentative writing, writers must brainstorm hierarchical writing goals, ensure the persuasiveness of their arguments, and revise and organize their plans through drafting. Recent advances in large language models (LLMs) have made interactive text generation through a chat interface (e.g., ChatGPT) possible. However, this approach often neglects implicit writing context and user intent, lacks support for user control and autonomy, and provides limited assistance for sensemaking and revising writing plans. To address these challenges, we introduce VISAR, an AI-enabled writing assistant system designed to help writers brainstorm and revise hierarchical goals within their writing context, organize argument structures through synchronized text editing and visual programming, and enhance persuasiveness with argumentation spark recommendations. VISAR allows users to explore, experiment with, and validate their writing plans using automatic draft prototyping. A controlled lab study confirmed the usability and effectiveness of VISAR in facilitating the argumentative writing planning process.
MLRegTest: A Benchmark for the Machine Learning of Regular Languages

Evaluating machine learning (ML) systems on their ability to learn known classifiers allows fine-grained examination of the patterns they can learn, which builds confidence when they are applied to the learning of unknown classifiers. This article presents a new benchmark for ML systems on sequence classification called MLRegTest, which contains training, development, and test sets from 1,800 regular languages. Different kinds of formal languages represent different kinds of long-distance dependencies, and correctly identifying long-distance dependencies in sequences is a known challenge for ML systems to generalize successfully. MLRegTest organizes its languages according to their logical complexity (monadic second order, first order, propositional, or monomial expressions) and the kind of logical literals (string, tier-string, subsequence, or combinations thereof). The logical complexity and choice of literal provides a systematic way to understand different kinds of long-distance dependencies in regular languages, and therefore to understand the capacities of different ML systems to learn such long-distance dependencies. Finally, the performance of different neural networks (simple RNN, LSTM, GRU, transformer) on MLRegTest is examined. The main conclusion is that their performance depends significantly on the kind of test set, the class of language, and the neural network architecture.
LongForm: Effective Instruction Tuning with Reverse Instructions

Instruction tuning enables language models to more effectively generalize and better follow user intent. However, obtaining instruction data is costly and challenging. Prior work employs methods such as expensive human annotation, crowd-sourced datasets with alignment issues, and generating noisy examples via LLMs. We introduce the LongForm-C dataset, which is created by reverse instructions. We generate instructions via LLMs for human-written corpus examples using reverse instructions. First we select a diverse set of human-written documents from corpora such as C4 and Wikipedia; then we generate instructions for these documents via LLMs. This approach provides a cheaper and cleaner instruction-tuning dataset with natural output and one suitable for long text generation. Our models outperform 10x larger language models without instruction tuning on tasks such as story/recipe generation and long-form question answering. Moreover, LongForm models outperform prior instruction-tuned models such as FLAN-T5 and Alpaca by a large margin, and improve language understanding capabilities further. Finally, our models can effectively follow and answer multilingual instructions; we demonstrate this for news generation. We publicly release our data and models: https://github.com/akoksal/LongForm.
Manifold Fitting

While classical data analysis has addressed observations that are real numbers or elements of a real vector space, at present many statistical problems of high interest in the sciences address the analysis of data that consist of more complex objects, taking values in spaces that are naturally not (Euclidean) vector spaces but which still feature some geometric structure. Manifold fitting is a long-standing problem, and has finally been addressed in recent years by Fefferman et al. (2020, 2021a). We develop a method with a theory guarantee that fits a $d$-dimensional underlying manifold from noisy observations sampled in the ambient space $\mathbb{R}^D$. The new approach uses geometric structures to obtain the manifold estimator in the form of image sets via a two-step mapping approach. We prove that, under certain mild assumptions and with a sample size $N=\mathcal{O}(\sigma^{(-d+3)})$, these estimators are true $d$-dimensional smooth manifolds whose estimation error, as measured by the Hausdorff distance, is bounded by $\mathcal{O}(\sigma^2\log(1/\sigma))$ with high probability. Compared with the existing approaches proposed in Fefferman et al. (2018, 2021b); Genovese et al. (2014); Yao and Xia (2019), our method exhibits superior efficiency while attaining very low error rates with a significantly reduced sample size, which scales polynomially in $\sigma^{-1}$ and exponentially in $d$. Extensive simulations are performed to validate our theoretical results. Our findings are relevant to various fields involving high-dimensional data in machine learning. Furthermore, our method opens up new avenues for existing non-Euclidean statistical methods in the sense that it has the potential to unify them to analyze data on manifolds in the ambience space domain.
Masked Pre-Training of Transformers for Histology Image Analysis

In digital pathology, whole slide images (WSIs) are widely used for applications such as cancer diagnosis and prognosis prediction. Visual transformer models have recently emerged as a promising method for encoding large regions of WSIs while preserving spatial relationships among patches. However, due to the large number of model parameters and limited labeled data, applying transformer models to WSIs remains challenging. Inspired by masked language models, we propose a pretext task for training the transformer model without labeled data to address this problem. Our model, MaskHIT, uses the transformer output to reconstruct masked patches and learn representative histological features based on their positions and visual features. The experimental results demonstrate that MaskHIT surpasses various multiple instance learning approaches by 3% and 2% on survival prediction and cancer subtype classification tasks, respectively. Furthermore, MaskHIT also outperforms two of the most recent state-of-the-art transformer-based methods. Finally, a comparison between the attention maps generated by the MaskHIT model with pathologist's annotations indicates that the model can accurately identify clinically relevant histological structures in each task.
Controlled regularity at future null infinity from past asymptotic initial data: massless fields

We study the relationship between asymptotic characteristic initial data at past null infinity and the regularity of solutions at future null infinity for the massless linear spin-s field equations on Minkowski space. By quantitatively controlling the solutions on a causal rectangle reaching the conformal boundary, we relate the (generically singular) behaviour of the solutions near past null infinity, future null infinity, and spatial infinity. Our analysis uses Friedrich's cylinder at spatial infinity together with a careful Gr\"onwall-type estimate that does not degenerate at the intersection of null infinity and the cylinder (the so-called critical sets).
Ab-initio Simulations of Coherent Phonon-Induced Pumping of Carriers in ZrTe 5

Laser-driven coherent phonons can act as modulated strain ﬁelds and modify the adiabatic ground state topology of quantum materials. We use time-dependent ﬁrst-principles and eﬀective model calculations to simulate the eﬀect of a strong terahertz electric ﬁeld on electronic carriers in the topological insulator ZrTe 5 . We show that a coherent A 1g Raman mode modulation can eﬀectively pump carriers across the band gap, even though the phonon energy is about an order of magnitude smaller than the equilibrium band gap. We reveal the microscopic mechanism of this eﬀect which occurs via Landau-Zener-St¨uckelberg tunneling of Bloch electrons in a narrow region in the Brillouin zone center where the transient energy gap closes when the system switches from strong to weak topological insulator. The quantum dynamics simulation results are in excellent agreement with recent pump-probe experiments in ZrTe 5 at low temperature.
Optimism, overconfidence, and moral hazard

I revisit the standard moral-hazard model, in which an agent's preference over contracts is rooted in costly effort choice. I characterise the behavioural content of the model in terms of empirically testable axioms, and show that the model's parameters are identified. I propose general behavioural definitions of relative (over)confidence and optimism, and characterise these in terms of the parameters of the moral-hazard model. My formal results are rooted in a simple but powerful insight: that the moral-hazard model is closely related to the well-known 'variational' model of choice under uncertainty.
OpenAssistant Conversations - Democratizing Large Language Model Alignment

Aligning large language models (LLMs) with human preferences has proven to drastically improve usability and has driven rapid adoption as demonstrated by ChatGPT. Alignment techniques such as supervised fine-tuning (SFT) and reinforcement learning from human feedback (RLHF) greatly reduce the required skill and domain knowledge to effectively harness the capabilities of LLMs, increasing their accessibility and utility across various domains. However, state-of-the-art alignment techniques like RLHF rely on high-quality human feedback data, which is expensive to create and often remains proprietary. In an effort to democratize research on large-scale alignment, we release OpenAssistant Conversations, a human-generated, human-annotated assistant-style conversation corpus consisting of 161,443 messages in 35 different languages, annotated with 461,292 quality ratings, resulting in over 10,000 complete and fully annotated conversation trees. The corpus is a product of a worldwide crowd-sourcing effort involving over 13,500 volunteers. Models trained on OpenAssistant Conversations show consistent improvements on standard benchmarks over respective base models. We release our code and data under a fully permissive licence.
A Hydrodynamic Study of the Escape of Metal Species and Excited Hydrogen from the Atmosphere of the Hot Jupiter WASP-121b

In the near-UV and optical transmission spectrum of the hot Jupiter WASP-121b, recent observations have detected strong absorption features of Mg, Fe, Ca, and Hα, extending outside of the planet’s Roche lobe. Studying these atomic signatures can directly trace the escaping atmosphere and constrain the energy balance of the upper atmosphere. To understand these features, we introduce a detailed forward model by expanding the capability of a one-dimensional model of the upper atmosphere and hydrodynamic escape to include important processes of atomic metal species. The hydrodynamic model is coupled to a Lyα Monte Carlo radiative transfer calculation to simulate the excited hydrogen population and associated heating/ionization effects. Using this model, we interpret the detected atomic features in the transmission spectrum of WASP-121b and explore the impact of metals and excited hydrogen on its upper atmosphere. We demonstrate the use of multiple absorption lines to impose stronger constraints on the properties of the upper atmosphere than the analysis of a single transmission feature can provide. In addition, the model shows that line broadening due to atmospheric outflow driven by Roche lobe overflow is necessary to explain the observed line widths and highlights the importance of the high mass-loss rate caused by Roche lobe overflow, which requires careful consideration of the structure of the lower and middle atmosphere. We also show that metal species and excited-state hydrogen can play an important role in the thermal and ionization balance of ultrahot Jupiter thermospheres.
Dually Lorentzian Polynomials

We introduce and study a notion of dually Lorentzian polynomials, and show that if $s$ is non-zero and dually Lorentzian then the operator \[s(\partial_{x_1},\ldots,\partial_{x_n}):\mathbb R[x_1,\ldots,x_n] \to \mathbb R[x_1,\ldots,x_n]\] preserves (strictly) Lorentzian polynomials. From this we conclude that any theory that admits a mixed Alexandrov-Fenchel inequality also admits a generalized Alexandrov-Fenchel inequality involving dually Lorentzian polynomials. As such we deduce generalized Alexandrov-Fenchel inequalities for mixed discriminants, for integrals of K\"ahler classes, for mixed volumes, and in the theory of valuations.
Topology, dynamics, and control of an octopus-analog muscular hydrostat

Muscular hydrostats, such as octopus arms or elephant trunks, lack bones entirely, endowing them with exceptional dexterity and reconfigurability. Key to their unmatched ability to control nearly infinite degrees of freedom is the architecture into which muscle fibers are weaved. Their arrangement is, effectively, the instantiation of a sophisticated mechanical program that mediates, and likely facilitates, the control and realization of complex, dynamic morphological reconfigurations. Here, by combining medical imaging, biomechanical data, live behavioral experiments and numerical simulations, we synthesize a model octopus arm entailing ~200 continuous muscles groups, and begin to unravel its complexity. We show how 3D arm motions can be understood in terms of storage, transport, and conversion of topological quantities, effected by simple muscle activation templates. These, in turn, can be composed into higher-level control strategies that, compounded by the arm's compliance, are demonstrated in a range of object manipulation tasks rendered additionally challenging by the need to appropriately align suckers, to sense and grasp. Overall, our work exposes broad design and algorithmic principles pertinent to muscular hydrostats, robotics, and dynamics, while significantly advancing our ability to model muscular structures from medical imaging, with potential implications for human health and care.
Search for galactic axions with a traveling wave parametric amplifier

A traveling wave parametric amplifier has been integrated in the haloscope of the QUAX experiment. A search for dark matter axions has been performed with a high Q dielectric cavity immersed in a 8 T magnetic field and read by a detection chain having a system noise temperature of about 2.1 K at the frequency of 10.353 GHz. Scanning has been conducted by varying the cavity frequency using sapphire rods immersed into the cavity. At multiple operating frequencies, the sensitivity of the instrument was at the level of viable axion models.
A genealogical interpretation of fixed and random effects models of complex traits

In the analysis of complex traits, genetic effects are frequently modelled as either fixed or random effects. Such assumptions serve as a foundation of defining heritability and relatedness using genome-wide single nucleotide polymorphism (SNP) markers. In this work, I propose a genealogical framework connecting the two assumptions conditional on the ancestral recombination graph (ARG). It turns out that the reference time point in which the probability is defined determines whether the effect of a variant to behave as either a fixed or random effect. This lays a connection between the PC regression and linear mixed model (LMM) for genetic association study. The framework induces a genetic relatedness matrix (GRM) in which the elements are a function of the time to the recent common ancestor. Subsequently, a novel trait variance decomposition respect to the regions sharing a common genealogy is followed. The variance decomposition then provides a natural means to define heritability and a potential method for gene mapping.