Miracle-dz/UniFAR-FTUs huggingface dataset:
Feasibility and Transferability of Transfer Learning: A Mathematical Framework

Transfer learning is an emerging and popular paradigm for utilizing existing knowledge from previous learning tasks to improve the performance of new ones. Despite its numerous empirical successes, theoretical analysis for transfer learning is limited. In this paper we build for the first time, to the best of our knowledge, a mathematical framework for the general procedure of transfer learning. Our unique reformulation of transfer learning as an optimization problem allows for the first time, analysis of its feasibility. Additionally, we propose a novel concept of transfer risk to evaluate transferability of transfer learning. Our numerical studies using the Office-31 dataset demonstrate the potential and benefits of incorporating transfer risk in the evaluation of transfer learning performance.
Laplacian regularized eikonal equation with Soner boundary condition on polyhedral meshes

In this paper, we propose a numerical algorithm based on a cell-centered finite volume method to compute a distance from given objects on a three-dimensional computational domain discretized by polyhedral cells. Inspired by the vanishing viscosity method, a Laplacian regularized eikonal equation is solved and the Soner boundary condition is applied to the boundary of the domain to avoid a non-viscosity solution. As the regularization parameter depending on a characteristic length of the discretized domain is reduced, a corresponding numerical solution is calculated. A convergence to the viscosity solution is verified numerically as the characteristic length becomes smaller and the regularization parameter accordingly becomes smaller. From the numerical experiments, the second experimental order of convergence in the $L^1$ norm error is confirmed for smooth solutions. Compared to solve a time-dependent form of eikonal equation, the Laplacian regularized eikonal equation has the advantage of reducing computational cost dramatically when a more significant number of cells is used or a region of interest is far away from the given objects. Moreover, the implementation of parallel computing using domain decomposition with $1$-ring face neighborhood structure can be done straightforwardly by a standard cell-centered finite volume code.
Automating Knowledge-Driven Model Recommendation: Methodology, Evaluation, and Key Challenges

—There is significant interest in using existing repositories of biological entities, relationships, and models to automate biological model assembly and extension. Current methods aggregate human-curated biological information into executable, simulatable models, but these models do not resemble human curated models and do not recapitulate experimental results. Here, we outline the process of automated model assembly and extension, while demonstrating it on both synthetic models and human-curated models of biological signaling networks. We begin with an iterative, greedy, and combinatoric approach to automated assembly and demonstrate the key difficulties inherent to contextless assembly. We publicly release the software used in this paper to enable further exploration of this problem.
Threshold dynamics of a nonlocal dispersal SIS epidemic model with free boundaries

To study the influence of the moving front of the infected interval and the spatial movement of individuals on the spreading or vanishing of infectious disease, we consider a nonlocal SIS (susceptible-infected-susceptible) reaction-diffusion model with media coverage, hospital bed numbers and free boundaries. The principal eigenvalue of the integral operator is defined, and the impacts of the diffusion rate of infected individuals and interval length on the principal eigenvalue are analyzed. Furthermore, sufficient conditions for spreading and vanishing of the disease are derived.Our results show that large media coverage and hospital bed numbers are beneficial to the prevention and control of disease. The difference between the model with nonlocal diffusion and that with local diffusion is also discussed and nonlocal diffusion leads to more possibilities.
Scale-free non-Hermitian skin effect in a boundary-dissipated spin chain

We study the open XXZ spin chain with a PTPT-symmetric non-Hermitian boundary field. We find an interaction-induced scale-free non-Hermitian skin effect by using the coordinate Bethe Ansatz. The steady-state and the ground state in the PTPT broken phase are constructed, and the formulas of their eigen-energies in the thermodynamic limit are obtained. The differences between the many-body scale-free states and the boundary string states are explored, and the transition between the two at the isotropic point is investigated. We also discuss an experimental scheme to verify our results.
Neural Episodic Control with State Abstraction

Existing Deep Reinforcement Learning (DRL) algorithms suffer from sample inefficiency. Generally, episodic control-based approaches are solutions that leverage highly-rewarded past experiences to improve sample efficiency of DRL algorithms. However, previous episodic control-based approaches fail to utilize the latent information from the historical behaviors (e.g., state transitions, topological similarities, etc.) and lack scalability during DRL training. This work introduces Neural Episodic Control with State Abstraction (NECSA), a simple but effective state abstraction-based episodic control containing a more comprehensive episodic memory, a novel state evaluation, and a multi-step state analysis. We evaluate our approach to the MuJoCo and Atari tasks in OpenAI gym domains. The experimental results indicate that NECSA achieves higher sample efficiency than the state-of-the-art episodic control-based approaches. Our data and code are available at the project website\footnote{\url{https://sites.google. com/view/drl-necsa}}.
DualCSG: Learning Dual CSG Trees for General and Compact CAD Modeling

We present DualCSG, a novel neural network composed of two dual and complementary branches for unsupervised learning of constructive solid geometry (CSG) representations of 3D CAD shapes. Our network is trained to re-construct a given 3D CAD shape through a compact assembly of quadric surface primitives via fixed-order CSG operations along two branches. The key difference between our method and all previous neural CSG models is that DualCSG has a dedicated branch, the residual branch , to assemble the potentially complex, complement or residual shape that is to be subtracted from an overall cover shape. The cover shape is modeled by the other branch, the cover branch . Both branches construct a union of primitive inter-sections, where the only difference is that the residual branch also learns primitive inverses while operating in the complement space. With the shape complements, our network is provably general. We demonstrate both quantitatively and qualitatively that our network produces CSG reconstructions with superior quality, more natural trees, and better quality-compactness tradeoff than all existing alternatives, especially over complex and high-genus CAD shapes.
Permutation-Based Hypothesis Testing for Neural Networks

Neural networks are powerful predictive models, but they provide little insight into the nature of relationships between predictors and outcomes. Although numerous methods have been proposed to quantify the relative contributions of input features, statistical inference and hypothesis testing of feature associations remain largely unexplored. We propose a permutation-based approach to testing that uses the partial derivatives of the network output with respect to specific inputs to assess both the significance of input features and whether significant features are linearly associated with the network output. These tests, which can be flexibly applied to a variety of network architectures, enhance the explanatory power of neural networks, and combined with powerful predictive capability, extend the applicability of these models.
Automatic differentiation as an effective tool in Electrical Impedance Tomography

Determining physical properties inside an object without access to direct measurements of target regions can be formulated as a specific type of \textit{inverse problem}. One of such problems is applied in \textit{Electrical Impedance Tomography} (EIT). In general, EIT can be posed as a minimization problem and solved by iterative methods, which require knowledge of derivatives of the objective function. In practice, this can be challenging because analytical closed-form solutions for them are hard to derive and implement efficiently. In this paper, we study the effectiveness of \textit{automatic differentiation (AD)} to solve EIT in a minimization framework. We devise a case study where we compare solutions of the inverse problem obtained with AD methods and with the manually-derived formulation of the derivative against the true solution. Furthermore, we study the viability of AD for large scale inverse problems by checking the memory and load requirements of AD as the resolution of the model increases. With powerful infrastructure, AD can pave the way for faster and simpler inverse solvers and provide better results than classical methods.
Chirp-Based Hierarchical Beam Training for Extremely Large-Scale Massive MIMO

XL-MIMO promises to provide ultrahigh data rates in Terahertz (THz) spectrum. However, the spherical-wavefront wireless transmission caused by large aperture array presents huge challenges for channel state information (CSI) acquisition. Two independent parameters (physical angles and transmission distance) should be simultaneously considered in XL-MIMO beamforming, which brings severe overhead consumption and beamforming degradation. To address this problem, we exploit the near-field channel characteristic and propose one low-overhead hierarchical beam training scheme for near-field XL-MIMO system. Firstly, we project near-field channel into spatial-angular domain and slope-intercept domain to capture detailed representations. Secondly, a novel spatial-chirp beam-aided codebook and corresponding hierarchical update policy are proposed. Theoretical analyses and numerical simulations are also displayed to verify the superior performances on beamforming and training overhead.
Embedding ensemble tracking in a stochastic framework for robust object tracking

We propose an algorithm of embedding ensemble tracking in a stochastic framework to achieve robust tracking performance under partial occlusion, illumination changes, and abrupt motion. It operates on likelihood images generated by the ensemble method, and combines mean shift and particle filtering in a principled way, where a better proposal distribution is designed by first propagating particles via a motion model, and then running mean shift to move towards their local peaks in the likelihood image. An observation model in the particle filter incorporates global and local information within a region, and an adaptive motion model is adopted to depict the evolution of the object state. The algorithm needs fewer particles to manage the tracking task compared with the general particle filter, and recaptures the object quickly after occlusion occurs. Experiments on two image sequences demonstrate the effectiveness and robustness of the proposed algorithm.
Tree-structured Policy Planning with Learned Behavior Models

Autonomous vehicles (AVs) need to reason about the multimodal behavior of neighboring agents while planning their own motion. Many existing trajectory planners seek a single trajectory that performs well under all plausible futures simultaneously, ignoring bi-directional interactions and thus leading to overly conservative plans. Policy planning, whereby the ego agent plans a policy that reacts to the environment's multimodal behavior, is a promising direction as it can account for the action-reaction interactions between the AV and the environment. However, most existing policy planners do not scale to the complexity of real autonomous vehicle applications: they are either not compatible with modern deep learning prediction models, not interpretable, or not able to generate high quality trajectories. To fill this gap, we propose Tree Policy Planning (TPP), a policy planner that is compatible with state-of-the-art deep learning prediction models, generates multistage motion plans, and accounts for the influence of ego agent on the environment behavior. The key idea of TPP is to reduce the continuous optimization problem into a tractable discrete Markov Decision Process (MDP) through the construction of two tree structures: an ego trajectory tree for ego trajectory options, and a scenario tree for multi-modal ego-conditioned environment predictions. We demonstrate the efficacy of TPP in closed-loop simulations based on real-world nuScenes dataset and results show that TPP scales to realistic AV scenarios and significantly outperforms non-policy baselines.
Naive Few-Shot Learning: Uncovering the fluid intelligence of machines

In this paper, we aimed to help bridge the gap between human fluid intelligence - the ability to solve novel tasks without prior training - and the performance of deep neural networks, which typically require extensive prior training. An essential cognitive component for solving intelligence tests, which in humans are used to measure fluid intelligence, is the ability to identify regularities in sequences. This motivated us to construct a benchmark task, which we term \textit{sequence consistency evaluation} (SCE), whose solution requires the ability to identify regularities in sequences. Given the proven capabilities of deep networks, their ability to solve such tasks after extensive training is expected. Surprisingly, however, we show that naive (randomly initialized) deep learning models that are trained on a \textit{single} SCE with a \textit{single} optimization step can still solve non-trivial versions of the task relatively well. We extend our findings to solve, without any prior training, real-world anomaly detection tasks in the visual and auditory modalities. These results demonstrate the fluid-intelligent computational capabilities of deep networks. We discuss the implications of our work for constructing fluid-intelligent machines.
Probing Out-of-Distribution Robustness of Language Models with Parameter-Efficient Transfer Learning

As the size of the pre-trained language model (PLM) continues to increase, numerous parameter-efficient transfer learning methods have been proposed recently to compensate for the high cost of fine-tuning. While large PLMs and various PETL methods have achieved impressive results on various benchmarks, it is uncertain whether they can effectively handle inputs that have been distributionally shifted. In this study, we systematically explore how the ability to detect out-of-distribution (OOD) changes as the size of the PLM grows or the transfer methods are altered. Specifically, we evaluated various PETL techniques, including fine-tuning, Adapter, LoRA, and prefix-tuning, with various language models with different scales.
Generating Synthetic Data for Conversational Music Recommendation Using Random Walks and Language Models

Conversational recommendation systems (CRSs) enable users to use natural language feedback to control their recommendations, overcoming many of the challenges of traditional recommendation systems. However, the practical adoption of CRSs remains limited due to a lack of rich and diverse conversational training data that pairs user utterances with recommendations. To address this problem, we introduce a new method to generate synthetic training data by transforming curated item collections, such as playlists or movie watch lists, into item-seeking conversations. First, we use a biased random walk to generate a sequence of slates, or sets of item recommendations; then, we use a language model to generate corresponding user utterances. We demonstrate our approach by generating a conversational music recommendation dataset with over one million conversations, which were found to be consistent with relevant recommendations by a crowdsourced evaluation. Using the synthetic data to train a CRS, we significantly outperform standard retrieval baselines in offline and online evaluations.
A Probabilistic View on Predictive Constructions for Bayesian Learning

Given a sequence $X=(X_1,X_2,\ldots)$ of random observations, a Bayesian forecaster aims to predict $X_{n+1}$ based on $(X_1,\ldots,X_n)$ for each $n\ge 0$. To this end, in principle, she only needs to select a collection $\sigma=(\sigma_0,\sigma_1,\ldots)$, called ``strategy"in what follows, where $\sigma_0(\cdot)=P(X_1\in\cdot)$ is the marginal distribution of $X_1$ and $\sigma_n(\cdot)=P(X_{n+1}\in\cdot\mid X_1,\ldots,X_n)$ the $n$-th predictive distribution. Because of the Ionescu-Tulcea theorem, $\sigma$ can be assigned directly, without passing through the usual prior/posterior scheme. One main advantage is that no prior probability is to be selected. In a nutshell, this is the predictive approach to Bayesian learning. A concise review of the latter is provided in this paper. We try to put such an approach in the right framework, to make clear a few misunderstandings, and to provide a unifying view. Some recent results are discussed as well. In addition, some new strategies are introduced and the corresponding distribution of the data sequence $X$ is determined. The strategies concern generalized P\'olya urns, random change points, covariates and stationary sequences.
Online Harassment in Majority Contexts: Examining Harms and Remedies across Countries

Online harassment is a global problem. This article examines perceptions of harm and preferences for remedies associated with online harassment with nearly 4000 participants in 14 countries around the world. The countries in this work reflect a range of identities and values, with a focus on those outside of North American and European contexts. Results show that perceptions of harm are higher among participants from all countries studied compared to the United States. Non-consensual sharing of sexual photos is consistently rated as harmful in all countries, while insults and rumors are perceived as more harmful in non-U.S. countries, especially harm to family reputation. Lower trust in other people and lower trust in sense of safety in one’s neighborhood correlate with increased perceptions of harm of online harassment. In terms of remedies, participants in most countries prefer monetary compensation, apologies, and publicly revealing offender’s identities compared to the U.S. Social media platform design and policy must consider regional values and norms, which may depart from U.S. centric-approaches.
Is Consensus Acceleration Possible in Decentralized Optimization over Slowly Time-Varying Networks?

We consider decentralized optimization problems where one aims to minimize a sum of convex smooth objective functions distributed between nodes in the network. The links in the network can change from time to time. For the setting when the amount of changes is arbitrary, lower complexity bounds and corresponding optimal algorithms are known, and the consensus acceleration is not possible. However, in practice the magnitude of network changes may be limited. We derive lower communication complexity bounds for several regimes of velocity of networks changes. Moreover, we show how to obtain accelerated communication rates for a certain class of time-varying graphs using a specific consensus algorithm.
Reinforcement Learning from Diverse Human Preferences

The complexity of designing reward functions has been a major obstacle to the wide application of deep reinforcement learning (RL) techniques. Describing an agent’s desired behaviors and prop-erties can be difﬁcult, even for experts. A new paradigm called reinforcement learning from human preferences (or preference-based RL) has emerged as a promising solution, in which reward functions are learned from human preference labels among behavior trajectories. However, existing methods for preference-based RL are lim-ited by the need for accurate oracle preference labels. This paper addresses this limitation by de-veloping a method for crowd-sourcing preference labels and learning from diverse human preferences. The key idea is to stabilize reward learning through regularization and correction in a latent space. To ensure temporal consistency, a strong constraint is imposed on the reward model that forces its latent space to be close to the prior distribution. Additionally, a conﬁdence-based reward model ensembling method is designed to generate more stable and reliable predictions. The proposed method is tested on a variety of tasks in DMcontrol and Meta-world and has shown consistent and signiﬁcant improvements over existing preference-based RL algorithms when learning from diverse feedback, paving the way for real-world applications of RL methods.
Bi-AM-RRT*: A Fast and Efficient Sampling-Based Motion Planning Algorithm in Dynamic Environments

The efficiency of sampling-based motion planning brings wide application in autonomous mobile robots. The conventional rapidly exploring random tree (RRT) algorithm and its variants have gained significant successes, but there are still challenges for the optimal motion planning of mobile robots in dynamic environments. In this paper, based on Bidirectional RRT and the use of an assisting metric (AM), we propose a novel motion planning algorithm, namely Bi-AM-RRT*. Different from the existing RRT-based methods, the AM with a larger connection distance is introduced in this paper to optimize the performance of robot motion planning in dynamic environments with obstacles. On this basis, the bidirectional search sampling strategy is employed to reduce the search time. Further, we present a new rewiring method to shorten path lengths. The effectiveness and efficiency of the proposed Bi-AM-RRT* are proved through comparative experiments in different environments. Experimental results show that the Bi-AM-RRT* algorithm can achieve better performance in terms of path length and search time, and always finds near-optimal paths with the shortest search time when the diffusion metric is used as the AM.
Creative beyond TikToks: Investigating Adolescents' Social Privacy Management on TikTok

TikTok has been criticized for its low privacy standards, but little is known about how its adolescent users protect their privacy. Based on interviews with 54 adolescents in Switzerland, this study provides a comprehensive understanding of young TikTok users' privacy management practices related to the creation of videos. The data were explored using the COM-B model, an established behavioral analysis framework adapted for sociotechnical privacy research. Our overall findings are in line with previous research on other social networks: adolescents are aware of privacy related to their online social connections (social privacy) and perform conscious privacy management. However, we also identified new patterns related to the central role of algorithmic recommendations potentially relevant for other social networks. Adolescents are aware that TikTok's special algorithm, combined with the app's high prevalence among their peers, could easily put them in the spotlight. Some adolescents also reduce TikTok, which was originally conceived as a social network, to its extensive audio-visual capabilities and share TikToks via more private channels (e.g., Snapchat) to manage audiences and avoid identification by peers. Young users also find other creative ways to protect their privacy such as identifying stalkers or maintaining multiple user accounts with different privacy settings to establish granular audience management. Based on our findings, we propose various concrete measures to develop interventions that protect the privacy of adolescents on TikTok.