Miracle-dz/UniFAR-FTUs huggingface dataset:
On the Benefits of Over-parameterization for Out-of-Distribution Generalization

In recent years, machine learning models have achieved success based on the independently and identically distributed assumption. However, this assumption can be easily violated in real-world applications, leading to the Out-of-Distribution (OOD) problem. Understanding how modern over-parameterized DNNs behave under non-trivial natural distributional shifts is essential, as current theoretical understanding is insufficient. Existing theoretical works often provide meaningless results for over-parameterized models in OOD scenarios or even contradict empirical findings. To this end, we are investigating the performance of the over-parameterized model in terms of OOD generalization under the general benign overfitting conditions. Our analysis focuses on a random feature model and examines non-trivial natural distributional shifts, where the benign overfitting estimators demonstrate a constant excess OOD loss, despite achieving zero excess in-distribution (ID) loss. We demonstrate that in this scenario, further increasing the model's parameterization can significantly reduce the OOD loss. Intuitively, the variance term of ID loss remains low due to orthogonality of long-tail features, meaning overfitting noise during training generally doesn't raise testing loss. However, in OOD cases, distributional shift increases the variance term. Thankfully, the inherent shift is unrelated to individual x, maintaining the orthogonality of long-tail features. Expanding the hidden dimension can additionally improve this orthogonality by mapping the features into higher-dimensional spaces, thereby reducing the variance term. We further show that model ensembles also improve OOD loss, akin to increasing model capacity. These insights explain the empirical phenomenon of enhanced OOD generalization through model ensembles, supported by consistent simulations with theoretical results.
Time to Evolve? Potential Evolutionary Responses of Fraser River Sockeye Salmon to Climate Change and Effects on Persistence

Evolutionary adaptation affects demographic resilience to climate change but few studies have attempted to project changes in selective pressures or quantify impacts of trait responses on population dynamics and extinction risk. We used a novel individual-based model to explore potential evolutionary changes in migration timing and the consequences for population persistence in sockeye salmon Oncorhynchus nerka in the Fraser River, Canada, under scenarios of future climate warming. Adult sockeye salmon are highly sensitive to increases in water temperature during their arduous upriver migration, raising concerns about the fate of these ecologically, culturally, and commercially important fish in a warmer future. Our results suggest that evolution of upriver migration timing could allow these salmon to avoid increasingly frequent stressful temperatures, with the odds of population persistence increasing in proportion to the trait heritability and phenotypic variance. With a simulated 2°C increase in average summer river temperatures by 2100, adult migration timing from the ocean to the river advanced by ∼10 days when the heritability was 0.5, while the risk of quasi-extinction was only 17% of that faced by populations with zero evolutionary potential (i.e., heritability fixed at zero). The rates of evolution required to maintain persistence under simulated scenarios of moderate to rapid warming are plausible based on estimated heritabilities and rates of microevolution of timing traits in salmon and related species, although further empirical work is required to assess potential genetic and ecophysiological constraints on phenological adaptation. These results highlight the benefits to salmon management of maintaining evolutionary potential within populations, in addition to conserving key habitats and minimizing additional stressors where possible, as a means to build resilience to ongoing climate change. More generally, they demonstrate the importance and feasibility of considering evolutionary processes, in addition to ecology and demography, when projecting population responses to environmental change.
A Moreau Envelope Approach for LQR Meta-Policy Estimation

We study the problem of policy estimation for the Linear Quadratic Regulator (LQR) in discrete-time linear time-invariant uncertain dynamical systems. We propose a Moreau Envelope-based surrogate LQR cost, built from a finite set of realizations of the uncertain system, to define a meta-policy efficiently adjustable to new realizations. Moreover, we design an algorithm to find an approximate first-order stationary point of the meta-LQR cost function. Numerical results show that the proposed approach outperforms naive averaging of controllers on new realizations of the linear system. We also provide empirical evidence that our method has better sample complexity than Model-Agnostic Meta-Learning (MAML) approaches.
Measuring and predicting quality of experience of DASH-based video streaming over LTE

Mobile video service becomes more and more popular with commercial deployment of Long Term Evolution (LTE) networks and other wireless access mechanisms. However, perfect LTE coverage with ubiquitous signal quality is not available in reality. Recently, adaptive HTTP video streaming over LTE has been gaining popularity. The quality of video service faces challenges. In this paper, we study the Quality of Experience (QoE) problems of Dynamic Adaptive Streaming over HTTP (DASH) video in LTE networks, building two machine learning models to predict user QoE based on LTE network quality metrics. The first model can be used by an user to estimate user QoE before he/she starts watching a DASH-based video, and the second model can be used by DASH adaptive bitrate control module to adjust its video bitrate in real time. We clearly demonstrate that the most important feature that causes QoE degradation of DASH-based video is Round Time Trip (RTT). Our prediction model and research results are beneficial for improvement and design of DASH adaptive bitrate control algorithm over LTE.
Neural Clustering based Visual Representation Learning

We investigate a fundamental aspect of machine vision: the measurement of features, by revisiting clustering, one of the most classic approaches in machine learning and data analysis. Existing visual feature extractors, including ConvNets, ViTs, and MLPs, represent an image as rectangular regions. Though prevalent, such a grid-style paradigm is built upon engineering practice and lacks explicit modeling of data distribution. In this work, we propose feature extraction with clustering (FEC), a conceptually elegant yet surprisingly ad-hoc interpretable neural clustering framework, which views feature extraction as a process of selecting representatives from data and thus automatically captures the underlying data distribution. Given an image, FEC alternates between grouping pixels into individual clusters to abstract representatives and updating the deep features of pixels with current representatives. Such an iterative working mechanism is implemented in the form of several neural layers and the final representatives can be used for downstream tasks. The cluster assignments across layers, which can be viewed and inspected by humans, make the forward process of FEC fully transparent and empower it with promising ad-hoc interpretability. Extensive experiments on various visual recognition models and tasks verify the effectiveness, generality, and interpretability of FEC. We expect this work will provoke a rethink of the current de facto grid-style paradigm.
Continual Few-shot Event Detection via Hierarchical Augmentation Networks

Traditional continual event detection relies on abundant labeled data for training, which is often impractical to obtain in real-world applications. In this paper, we introduce continual few-shot event detection (CFED), a more commonly encountered scenario when a substantial number of labeled samples are not accessible. The CFED task is challenging as it involves memorizing previous event types and learning new event types with few-shot samples. To mitigate these challenges, we propose a memory-based framework: Hierarchical Augmentation Networks (HANet). To memorize previous event types with limited memory, we incorporate prototypical augmentation into the memory set. For the issue of learning new event types in few-shot scenarios, we propose a contrastive augmentation module for token representations. Despite comparing with previous state-of-the-art methods, we also conduct comparisons with ChatGPT. Experiment results demonstrate that our method significantly outperforms all of these methods in multiple continual few-shot event detection tasks.
CANOS: A Fast and Scalable Neural AC-OPF Solver Robust To N-1 Perturbations

Optimal Power Flow (OPF) refers to a wide range of related optimization problems with the goal of operating power systems efficiently and securely. In the simplest setting, OPF determines how much power to generate in order to minimize costs while meeting demand for power and satisfying physical and operational constraints. In even the simplest case, power grid operators use approximations of the AC-OPF problem because solving the exact problem is prohibitively slow with state-of-the-art solvers. These approximations sacrifice accuracy and operational feasibility in favor of speed. This trade-off leads to costly"uplift payments"and increased carbon emissions, especially for large power grids. In the present work, we train a deep learning system (CANOS) to predict near-optimal solutions (within 1% of the true AC-OPF cost) without compromising speed (running in as little as 33--65 ms). Importantly, CANOS scales to realistic grid sizes with promising empirical results on grids containing as many as 10,000 buses. Finally, because CANOS is a Graph Neural Network, it is robust to changes in topology. We show that CANOS is accurate across N-1 topological perturbations of a base grid typically used in security-constrained analysis. This paves the way for more efficient optimization of more complex OPF problems which alter grid connectivity such as unit commitment, topology optimization and security-constrained OPF.
Utilizing (Al, Ga)2O3/Ga2O3 superlattices to measure cation vacancy diffusion and vacancy-concentration-dependent diffusion of Al, Sn, and Fe in \b{eta} -Ga2O3

Diffusion of native defects such as vacancies and their interactions with impurities are fundamental in semiconductor crystal growth, device processing, and long-term aging of equilibration and transient diffusion of vacancies are rarely investigated. We used aluminum-gallium oxide/gallium oxide superlattices (SLs) to detect and analyze transient diffusion of cation vacancies during annealing in O2 at 1000-1100 C. Using a novel finite difference scheme for the diffusion equation with time- and space-varying diffusion constant, we extract diffusion constants for Al, Fe, and cation vacancies under the given conditions, including the vacancy concentration dependence for Al. indicate that vacancies present in the substrate transiently diffuse through the SLs, interacting with Sn as it also diffuses. In the case of SLs grown on Sn-doped beta-gallium oxide substrates, gradients observed in the extent of Al diffusion indicate that vacancies present in the substrate transiently diffuse through the SLs, interacting with Sn as it also diffuses. In the case of SLs grown on (010) Fe-doped substrates, the Al diffusion is uniform through the SLs, indicating a depth-uniform concentration of vacancies. We find no evidence in either case for the introduction of gallium vacancies from the free surface at rates sufficient to affect Al diffusion down to ppm concentrations, which has important bearing on the validity of typically-made assumptions of vacancy equilibration. Additionally, we show that unintentional impurities in Sn-doped gallium oxide such as Fe, Ni, Mn, Cu, and Li also diffuse towards the surface and accumulate. Many of these likely have fast interstitial diffusion modes capable of destabilizing devices over time, thus highlighting the importance of controlling unintentional impurities in beta-gallium oxide wafers.
LOTUS: Evasive and Resilient Backdoor Attacks through Sub-Partitioning

Backdoor attack poses a significant security threat to Deep Learning applications. Existing attacks are often not evasive to established backdoor detection techniques. This susceptibility primarily stems from the fact that these attacks typically leverage a universal trigger pattern or transformation function, such that the trigger can cause misclassification for any input. In response to this, recent papers have introduced attacks using sample-specific invisible triggers crafted through special transformation functions. While these approaches manage to evade detection to some extent, they reveal vulnerability to existing backdoor mitigation techniques. To address and enhance both evasiveness and resilience, we introduce a novel backdoor attack LOTUS. Specifically, it leverages a secret function to separate samples in the victim class into a set of partitions and applies unique triggers to different partitions. Furthermore, LOTUS incorporates an effective trigger focusing mechanism, ensuring only the trigger corresponding to the partition can induce the backdoor behavior. Extensive experimental results show that LOTUS can achieve high attack success rate across 4 datasets and 7 model structures, and effectively evading 13 backdoor detection and mitigation techniques. The code is available at https://github.com/Megum1/LOTUS.
GOLF: Goal-Oriented Long-term liFe tasks supported by human-AI collaboration

The advent of ChatGPT and similar large language models (LLMs) has revolutionized the human-AI interaction and information-seeking process. Leveraging LLMs as an alternative to search engines, users can now access summarized information tailored to their queries, significantly reducing the cognitive load associated with navigating vast information resources. This shift underscores the potential of LLMs in redefining information access paradigms. Drawing on the foundation of task-focused information retrieval and LLMs' task planning ability, this research extends the scope of LLM capabilities beyond routine task automation to support users in navigating long-term and significant life tasks. It introduces the GOLF framework (Goal-Oriented Long-term liFe tasks), which focuses on enhancing LLMs' ability to assist in significant life decisions through goal orientation and long-term planning. The methodology encompasses a comprehensive simulation study to test the framework's efficacy, followed by model and human evaluations to develop a dataset benchmark for long-term life tasks, and experiments across different models and settings. By shifting the focus from short-term tasks to the broader spectrum of long-term life goals, this research underscores the transformative potential of LLMs in enhancing human decision-making processes and task management, marking a significant step forward in the evolution of human-AI collaboration.
REFeREE: A REference-FREE Model-Based Metric for Text Simplification

Text simplification lacks a universal standard of quality, and annotated reference simplifications are scarce and costly. We propose to alleviate such limitations by introducing REFeREE, a reference-free model-based metric with a 3-stage curriculum. REFeREE leverages an arbitrarily scalable pretraining stage and can be applied to any quality standard as long as a small number of human annotations are available. Our experiments show that our metric outperforms existing reference-based metrics in predicting overall ratings and reaches competitive and consistent performance in predicting specific ratings while requiring no reference simplifications at inference time.
Estimating Poaching Opportunity and Potential

Most governments today protect wolves, bears, and big cats from unregulated killing (Epstein, 2013). Such protections for large carnivores (LC) can be controversial for people who perceive they are sacrificing safety, recreation, or economic opportunity (Nie, 2003; Treves et al., 2015). Perceptions of these risks appear strongly influenced by both the costs and the benefits of living with LC and other wild animals (Bruskotter & Wilson, 2014). Public discourse and media representations of the balance of benefits with costs may play a large role in diverse audiences’ actions and reactions to LC and their management. Opponents of LC protection sometimes aim to reduce LC numbers legally or illegally by poaching (Banse, 2011; St. John et al., 2012; von Essen, Hansen, Kallstrom, Peterson, & Peterson, 2015). Legal opposition to LC protections has been studied extensively; this chapter is focused on lesser known illegal opposition (Gavin, Solomon, & Blank; 2010; Muth, 1998).
Localized Inverse Design in Conservation Laws and Hamilton-Jacobi Equations

Consider the inverse design problem for a scalar conservation law, i.e., the problem of finding initial data evolving into a given profile at a given time. The solution we present below takes into account localizations both in the final interval where the profile is assigned and in the initial interval where the datum is sought, as well as additional a priori constraints on the datum's range provided by the model. These results are motivated and can be applied to data assimilation procedures in traffic modeling and accidents localization.
AniArtAvatar: Animatable 3D Art Avatar from a Single Image

We present a novel approach for generating animatable 3D-aware art avatars from a single image, with controllable facial expressions, head poses, and shoulder movements. Unlike previous reenactment methods, our approach utilizes a view-conditioned 2D diffusion model to synthesize multi-view images from a single art portrait with a neutral expression. With the generated colors and normals, we synthesize a static avatar using an SDF-based neural surface. For avatar animation, we extract control points, transfer the motion with these points, and deform the implicit canonical space. Firstly, we render the front image of the avatar, extract the 2D landmarks, and project them to the 3D space using a trained SDF network. We extract 3D driving landmarks using 3DMM and transfer the motion to the avatar landmarks. To animate the avatar pose, we manually set the body height and bound the head and torso of an avatar with two cages. The head and torso can be animated by transforming the two cages. Our approach is a one-shot pipeline that can be applied to various styles. Experiments demonstrate that our method can generate high-quality 3D art avatars with desired control over different motions.
Nonlinear Edelstein Effect in Strongly Correlated Electron Systems

Nonlinear spintronics, which combines nonlinear dynamics and spintronics, opens a new route for controlling spins and spin dynamics beyond conventional spintronics based on linear responses. Strongly correlated electron systems, which can have large nonlinear responses, are promising candidates for nonlinear spintronics. In this paper, we focus on the nonlinear Edelstein effect (NEE), a generalization of the Edelstein effect, and study the impact of electron correlations on the NEE by performing numerical calculations on a Hubbard model. We find that correlation effects can either enhance or suppress the nonlinear response. We show that the enhancement and suppression of the response are due to the real and imaginary components of the self-energy, respectively. Additionally, we have explored the relationship between the NEE and photomagnetic or optomagnetic effects. Our findings demonstrate that electron correlations can either enhance or suppress the optical spin injection, depending on the light frequency, while always strengthening the inverse Faraday effect.
On the Impact of Black-box Deployment Strategies for Edge AI on Latency and Model Performance

Deciding what combination of operators to use across the Edge AI tiers to achieve specific latency and model performance requirements is an open question for MLOps engineers. This study aims to empirically assess the accuracy vs inference time trade-off of different black-box Edge AI deployment strategies, i.e., combinations of deployment operators and deployment tiers. In this paper, we conduct inference experiments involving 3 deployment operators (i.e., Partitioning, Quantization, Early Exit), 3 deployment tiers (i.e., Mobile, Edge, Cloud) and their combinations on four widely used Computer-Vision models to investigate the optimal strategies from the point of view of MLOps developers. Our findings suggest that Edge deployment using the hybrid Quantization + Early Exit operator could be preferred over non-hybrid operators (Quantization/Early Exit on Edge, Partition on Mobile-Edge) when faster latency is a concern at medium accuracy loss. However, when minimizing accuracy loss is a concern, MLOps engineers should prefer using only a Quantization operator on edge at a latency reduction or increase, respectively over the Early Exit/Partition (on edge/mobile-edge) and Quantized Early Exit (on edge) operators. In scenarios constrained by Mobile CPU/RAM resources, a preference for Partitioning across mobile and edge tiers is observed over mobile deployment. For models with smaller input data samples (such as FCN), a network-constrained cloud deployment can also be a better alternative than Mobile/Edge deployment and Partitioning strategies. For models with large input data samples (ResNet, ResNext, DUC), an edge tier having higher network/computational capabilities than Cloud/Mobile can be a more viable option than Partitioning and Mobile/Cloud deployment strategies.
Tiny Models are the Computational Saver for Large Models

This paper introduces TinySaver, an early-exit-like dynamic model compression approach which employs tiny models to substitute large models adaptively. Distinct from traditional compression techniques, dynamic methods like TinySaver can leverage the difficulty differences to allow certain inputs to complete their inference processes early, thereby conserving computational resources. Most existing early exit designs are implemented by attaching additional network branches to the model's backbone. Our study, however, reveals that completely independent tiny models can replace a substantial portion of the larger models' job with minimal impact on performance. Employing them as the first exit can remarkably enhance computational efficiency. By searching and employing the most appropriate tiny model as the computational saver for a given large model, the proposed approaches work as a novel and generic method to model compression. This finding will help the research community in exploring new compression methods to address the escalating computational demands posed by rapidly evolving AI models. Our evaluation of this approach in ImageNet-1k classification demonstrates its potential to reduce the number of compute operations by up to 90%, with only negligible losses in performance, across various modern vision models. The code of this work will be available.