Miracle-dz/UniFAR-FTUs huggingface dataset:
SalienDet: A Saliency-Based Feature Enhancement Algorithm for Object Detection for Autonomous Driving

Object detection (OD) is crucial to autonomous driving. On the other hand, unknown objects, which have not been seen in training sample set, are one of the reasons that hinder autonomous vehicles from driving beyond the operational domain. To addresss this issue, we propose a saliency-based OD algorithm (SalienDet) to detect unknown objects. Our SalienDet utilizes a saliency-based algorithm to enhance image features for object proposal generation. Moreover, we design a dataset relabeling approach to differentiate the unknown objects from all objects in training sample set to achieve Open-World Detection. To validate the performance of SalienDet, we evaluate SalienDet on KITTI, nuScenes, and BDD datasets, and the result indicates that it outperforms existing algorithms for unknown object detection. Notably, SalienDet can be easily adapted for incremental learning in open-world detection tasks.
An inexact proximal linearized DC algorithm with provably terminating inner loop

Standard approaches to difference-of-convex (DC) programs require exact solution to a convex subproblem at each iteration, which generally requires noiseless computation and infinite iterations of an inner iterative algorithm. To tackle these difficulties, inexact DC algorithms have been proposed, mostly by relaxing the convex subproblem to an approximate monotone inclusion problem. However, there is no guarantee that such relaxation can lead to a finitely terminating inner loop. In this paper, we point out the termination issue of existing inexact DC algorithms by presenting concrete counterexamples. Exploiting the notion of $\epsilon$-subdifferential, we propose a novel inexact proximal linearized DC algorithm termed tPLDCA. Despite permission to a great extent of inexactness in computation, tPLDCA enjoys the same convergence guarantees as exact DC algorithms. Most noticeably, the inner loop of tPLDCA is guaranteed to terminate in finite iterations as long as the inner iterative algorithm converges to a solution of the proximal point subproblem, which makes an essential difference from prior arts. In addition, by assuming the first convex component of the DC function to be pointwise maximum of finitely many convex smooth functions, we propose a computational friendly surrogate of $\epsilon$-subdifferential, whereby we develop a feasible implementation of tPLDCA. Numerical results demonstrate the effectiveness of the proposed implementation of tPLDCA.
Transversal Hamilton cycle in hypergraph systems

A $k$-graph system $\textbf{H}=\{H_i\}_{i\in[m]}$ is a family of not necessarily distinct $k$-graphs on the same $n$-vertex set $V$ and a $k$-graph $H$ on $V$ is said to be $\textbf{H}$-transversal provided that there exists an injection $\varphi: E(H)\rightarrow [m]$ such that $e\in E(H_{\varphi(e)})$ for all $e\in E(H)$. We show that given $k\geq3, \gamma>0$, sufficiently large $n$ and an $n$-vertex $k$-graph system $\textbf{H}=\{H_i\}_{i\in[n]}$, if $\delta_{k-1}(H_i)\geq(1/2+\gamma)n$ for each $i\in[n]$, then there exists an $\textbf{H}$-transversal tight Hamilton cycle. This extends the result of R\"{o}dl, Ruci\'{n}ski and Szemer\'{e}di [Combinatorica, 2008] on single $k$-graphs.
Combo of Thinking and Observing for Outside-Knowledge VQA

Outside-knowledge visual question answering is a challenging task that requires both the acquisition and the use of open-ended real-world knowledge. Some existing solutions draw external knowledge into the cross-modality space which overlooks the much vaster textual knowledge in natural-language space, while others transform the image into a text which further fuses with the textual knowledge into the natural-language space and completely abandons the use of visual features. In this paper, we are inspired to constrain the cross-modality space into the same space of natural-language space which makes the visual features preserved directly, and the model still benefits from the vast knowledge in natural-language space. To this end, we propose a novel framework consisting of a multimodal encoder, a textual encoder and an answer decoder. Such structure allows us to introduce more types of knowledge including explicit and implicit multimodal and textual knowledge. Extensive experiments validate the superiority of the proposed method which outperforms the state-of-the-art by 6.17% accuracy. We also conduct comprehensive ablations of each component, and systematically study the roles of varying types of knowledge. Codes and knowledge data are to be released.
Review of the application piezoelectric actuators for SRF cavity tuners

Modern particle accelerators and high-energy physics experiments that deployed up to several hundred of accelerating superconducting RF cavities require accurate frequency control. This is achieved by using cavity tuners typically actuated with the piezoelectric ceramic actuators. Piezoelectric ceramic actuators have become"standard"components of the SRF cavity tuner and depending on the application could be operated in different environments: in air, at cryogenic temperature, in vacuum, and submerged in liquid helium. Different applications place different requirements on the piezo actuators, but the important parameters common to all applications are the lifetime and reliability of the actuators. Several programs targeting the development of reliable piezo actuators are presented in this contribution.
Optimal metrics for the first curl eigenvalue on 3-manifolds

In this article we analyze the spectral properties of the curl operator on closed Riemannian 3-manifolds. Specifically, we study metrics that are optimal in the sense that they minimize the first curl eigenvalue among any other metric of the same volume in the same conformal class. We establish a connection between optimal metrics and the existence of minimizers for the $L^2$-norm in a fixed helicity class, which is exploited to obtain necessary and sufficient conditions for a metric to be locally optimal. As a consequence, our main result is that we prove that $\mathbf{S}^3$ and $\mathbf{R}P^3$ endowed with the round metric are local minimizers for the first curl eigenvalue (in its conformal and volume class). The connection between the curl operator and the Hodge Laplacian allows us to infer that the canonical metrics of $\mathbf{S}^3$ and $\mathbf{R}P^3$ are locally optimal for the first eigenvalue of the Hodge Laplacian on coexact 1-forms. This is in strong contrast to what happens in dimension 4.
Control of a Back-Support Exoskeleton to Assist Carrying Activities

Back-support exoskeletons are commonly used in the workplace to reduce low back pain risk for workers performing demanding activities. However, for the assistance of tasks differing from lifting, back-support exoskeletons potential has not been exploited extensively. This work focuses on the use of an active back-support exoskeleton to assist carrying. A control strategy is designed that modulates the exoskeleton torques to comply with the task assistance requirements. In particular, two gait phase detection frameworks are exploited to adapt the exoskeleton assistance according to the legs' motion. The control strategy is assessed through an experimental analysis on ten subjects. Carrying task is performed without and with the exoskeleton assistance. Results prove the potential of the presented control in assisting the task without hindering the gait movement and improving the usability experienced by users. Moreover, the exoskeleton assistance significantly reduces the lumbar load associated with the task, demonstrating its promising use for risk mitigation in the workplace.
Comparing theoretical predictions of radiation-free velocities of edge dislocations to molecular dynamics simulations

Transonic defect motion is of interest for high strain-rate plastic deformation as well as for crack propagation. Ever since Eshelby's 1949 prediction in the isotropic limit of a 'radiation-free' transonic velocity $v_\text{RF}=\sqrt{2}c_{\textrm{T}}$, where shock waves are absent, there has been speculation about the significance of radiation-free velocities for defect mobility. Here, we argue that they do not play any significant role in dislocation dynamics in metals, based on comparing theoretical predictions of radiation-free velocities for transonic edge dislocations with molecular dynamics simulations for two face-centered cubic (FCC) metals: Cu, which has no radiation-free states, and Ag, which does.
Friable averages of complex arithmetic functions

We evaluate friable averages of arithmetic functions whose Dirichlet series is analytically close to some complex power of the Riemann zeta function. We obtain asymptotic expansions resembling those provided by the Selberg-Delange method in the non-friable case. Some application are provided to the friable distribution of the additive function counting the total number of prime factors.
A statistical approach to detect sensitive features in a group fairness setting

The use of machine learning models in decision support systems with high societal impact raised concerns about unfair (disparate) results for different groups of people. When evaluating such unfair decisions, one generally relies on predefined groups that are determined by a set of features that are considered sensitive. However, such an approach is subjective and does not guarantee that these features are the only ones to be considered as sensitive nor that they entail unfair (disparate) outcomes. In this paper, we propose a preprocessing step to address the task of automatically recognizing sensitive features that does not require a trained model to verify unfair results. Our proposal is based on the Hilber-Schmidt independence criterion, which measures the statistical dependence of variable distributions. We hypothesize that if the dependence between the label vector and a candidate is high for a sensitive feature, then the information provided by this feature will entail disparate performance measures between groups. Our empirical results attest our hypothesis and show that several features considered as sensitive in the literature do not necessarily entail disparate (unfair) results.
Fair Price Discrimination

A seller is pricing identical copies of a good to a stream of unit-demand buyers. Each buyer has a value on the good as his private information. The seller only knows the empirical value distribution of the buyer population and chooses the revenue-optimal price. We consider a widely studied third-degree price discrimination model where an information intermediary with perfect knowledge of the arriving buyer's value sends a signal to the seller, hence changing the seller's posterior and inducing the seller to set a personalized posted price. Prior work of Bergemann, Brooks, and Morris (American Economic Review, 2015) has shown the existence of a signaling scheme that preserves seller revenue, while always selling the item, hence maximizing consumer surplus. In a departure from prior work, we ask whether the consumer surplus generated is fairly distributed among buyers with different values. To this end, we aim to maximize welfare functions that reward more balanced surplus allocations. Our main result is the surprising existence of a novel signaling scheme that simultaneously $8$-approximates all welfare functions that are non-negative, monotonically increasing, symmetric, and concave, compared with any other signaling scheme. Classical examples of such welfare functions include the utilitarian social welfare, the Nash welfare, and the max-min welfare. Such a guarantee cannot be given by any consumer-surplus-maximizing scheme -- which are the ones typically studied in the literature. In addition, our scheme is socially efficient, and has the fairness property that buyers with higher values enjoy higher expected surplus, which is not always the case for existing schemes.
Think Twice: Measuring the Efficiency of Eliminating Prediction Shortcuts of Question Answering Models

While the Large Language Models (LLMs) dominate a majority of language understanding tasks, previous work shows that some of these results are supported by modelling spurious correlations of training datasets. Authors commonly assess model robustness by evaluating their models on out-of-distribution (OOD) datasets of the same task, but these datasets might share the bias of the training dataset. We propose a simple method for measuring a scale of models’ reliance on any identified spurious feature and assess the robustness towards a large set of known and newly found prediction biases for various pre-trained models and debiasing methods in Question Answering (QA). We find that the reported OOD gains of debiasing methods can not be explained by mitigated reliance on biased features, suggesting that biases are shared among different QA datasets. We further evidence this by measuring that performance of OOD models depends on bias features comparably to the ID model. Our findings motivate future work to refine the reports of LLMs’ robustness to a level of known spurious features.
Real-time Manipulation of Liquid Droplets using Photo-responsive Surfactant

Fast and programmable transport of liquid droplets on a solid substrate is desirable in microfluidic, thermal, biomedical, and energy devices. Past research has focused on designing substrates with asymmetric structures or gradient wettability where droplet behaviors are passively controlled, or by applying external electric, thermal, magnetic, or acoustic stimuli that either require the fabrication of electrodes or a strong applied field. In this work, we demonstrate tunable and programmable droplet motion on liquid-infused surfaces (LIS) and inside solid-surface capillary channels using low-intensity light and photo-responsive surfactants. When illuminated by the light of appropriate wavelengths, the surfactants can reversibly change their molecular conformation thereby tuning interfacial tensions in a multi-phase fluid system. This generates a Marangoni flow that drives droplet motions. With two novel surfactants that we synthesized, we demonstrate fast linear and complex 2D movements of droplets on liquid surfaces, on LIS, and inside microchannels. We also visualized the internal flow pattern using tracer particles and developed simple scaling arguments to explain droplet-size-dependent velocity. The method demonstrated in this study serves as a simple and exciting new approach for the dynamic manipulation of droplets for microfluidic, thermal, and water harvesting devices.
A causal roadmap for generating high-quality real-world evidence

Abstract Increasing emphasis on the use of real-world evidence (RWE) to support clinical policy and regulatory decision-making has led to a proliferation of guidance, advice, and frameworks from regulatory agencies, academia, professional societies, and industry. A broad spectrum of studies use real-world data (RWD) to produce RWE, ranging from randomized trials with outcomes assessed using RWD to fully observational studies. Yet, many proposals for generating RWE lack sufficient detail, and many analyses of RWD suffer from implausible assumptions, other methodological flaws, or inappropriate interpretations. The Causal Roadmap is an explicit, itemized, iterative process that guides investigators to prespecify study design and analysis plans; it addresses a wide range of guidance within a single framework. By supporting the transparent evaluation of causal assumptions and facilitating objective comparisons of design and analysis choices based on prespecified criteria, the Roadmap can help investigators to evaluate the quality of evidence that a given study is likely to produce, specify a study to generate high-quality RWE, and communicate effectively with regulatory agencies and other stakeholders. This paper aims to disseminate and extend the Causal Roadmap framework for use by clinical and translational researchers; three companion papers demonstrate applications of the Causal Roadmap for specific use cases.
Hyperbolic Deep Learning in Computer Vision: A Survey

Deep representation learning is a ubiquitous part of modern computer vision. While Euclidean space has been the de facto standard manifold for learning visual representations, hyperbolic space has recently gained rapid traction for learning in computer vision. Specifically, hyperbolic learning has shown a strong potential to embed hierarchical structures, learn from limited samples, quantify uncertainty, add robustness, limit error severity, and more. In this paper, we provide a categorization and in-depth overview of current literature on hyperbolic learning for computer vision. We research both supervised and unsupervised literature and identify three main research themes in each direction. We outline how hyperbolic learning is performed in all themes and discuss the main research problems that benefit from current advances in hyperbolic learning for computer vision. Moreover, we provide a high-level intuition behind hyperbolic geometry and outline open research questions to further advance research in this direction.
Randomized Smoothing with Masked Inference for Adversarially Robust Text Classifications

Large-scale pre-trained language models have shown outstanding performance in a variety of NLP tasks. However, they are also known to be significantly brittle against specifically crafted adversarial examples, leading to increasing interest in probing the adversarial robustness of NLP systems. We introduce RSMI, a novel two-stage framework that combines randomized smoothing (RS) with masked inference (MI) to improve the adversarial robustness of NLP systems. RS transforms a classifier into a smoothed classifier to obtain robust representations, whereas MI forces a model to exploit the surrounding context of a masked token in an input sequence. RSMI improves adversarial robustness by 2 to 3 times over existing state-of-the-art methods on benchmark datasets. We also perform in-depth qualitative analysis to validate the effectiveness of the different stages of RSMI and probe the impact of its components through extensive ablations. By empirically proving the stability of RSMI, we put it forward as a practical method to robustly train large-scale NLP models. Our code and datasets are available at https://github.com/Han8931/rsmi_nlp
Semi-analytical Expression of G-mode Period Spacing: The Case of Brunt–Väisälä Frequency with Not a Jump but a Ramp

To decipher complex patterns of gravity-mode period spacings observed for intermediate-mass main-sequence stars is an important step toward a better understanding of the structure and dynamics in the deep radiative region of the stars. In this study, we apply the JWKB approximation to derive a semi-analytical expression of the g-mode period spacing pattern, for which the gradient in the Brunt–Väisälä frequency is taken into account. The formulation includes the term P −1 B ⋆, where P and B ⋆ represent the g-mode period and degree of the structural variation, the latter of which especially is related to the steepness of the gradient of the Brunt–Väisälä frequency. Tests with one-dimensional stellar models show that the semi-analytical expression derived in this study is useful for inferring the degree of the structural variation B ⋆ with an accuracy of ∼10 % in the case of relatively massive intermediate-mass models with the mass M larger than 3 M ⊙. The newly formulated expression will possibly allow us to put further constraints on, e.g., mixing processes inside intermediate-mass main-sequence g-mode pulsators such as β Cep, SPB, and γ Dor stars that have been principal targets in asteroseismology.
Phase Shift Compression for Control Signaling Reduction in IRS-Aided Wireless Systems: Global Attention and Lightweight Design

A potential 6G technology known as intelligent reflecting surface (IRS) has recently gained much attention from academia and industry. However, acquiring the optimized quantized phase shift (QPS) presents challenges for the IRS due to the phenomenon of signaling storms. In this paper, we attempt to solve the above problem by proposing two deep learning models, the global attention phase shift compression network (GAPSCN) and the simplified GAPSCN (S-GAPSCN). In GAPSCN, we propose a novel attention mechanism that emphasizes a greater number of meaningful features than previous attention-related works. Additionally, S-GAPSCN is built with an asymmetric architecture to meet the practical constraints on computation resources of the IRS controller. Moreover, in S-GAPSCN, to compensate for the performance degradation caused by simplifying the model, we design a low-computation complexity joint attention-assisted multi-scale network (JAAMSN) module in the decoder of S-GAPSCN. Simulation results demonstrate that the proposed global attention mechanism achieves prominent performance compared with the existing attention mechanisms and the proposed GAPSCN can achieve reliable reconstruction performance compared with existing state-of-the-art models. Furthermore, the proposed S-GAPSCN can approach the performance of the GAPSCN at a much lower computational cost.
Almost invariant CND kernels and proper uniformly Lipschitz actions on subspaces of $L^1$

We define the notion of almost invariant conditionally negative definite kernel and use it to give a characterisation of groups admitting a proper uniformly Lipschitz affine action on a subspace of an $L^1$ space. We show that this condition is satisfied by groups acting properly on products of quasi-trees, weakly amenable groups with Cowling-Haagerup constant 1, and a-TTT-menable groups.
Provably Efficient Risk-Sensitive Reinforcement Learning: Iterated CVaR and Worst Path

In this paper, we study a novel episodic risk-sensitive Reinforcement Learning (RL) problem, named Iterated CVaR RL, which aims to maximize the tail of the reward-to-go at each step, and focuses on tightly controlling the risk of getting into catastrophic situations at each stage. This formulation is applicable to real-world tasks that demand strong risk avoidance throughout the decision process, such as autonomous driving, clinical treatment planning and robotics. We investigate two performance metrics under Iterated CVaR RL, i.e., Regret Minimization and Best Policy Identification. For both metrics, we design efficient algorithms ICVaR-RM and ICVaR-BPI, respectively, and provide nearly matching upper and lower bounds with respect to the number of episodes $K$. We also investigate an interesting limiting case of Iterated CVaR RL, called Worst Path RL, where the objective becomes to maximize the minimum possible cumulative reward. For Worst Path RL, we propose an efficient algorithm with constant upper and lower bounds. Finally, our techniques for bounding the change of CVaR due to the value function shift and decomposing the regret via a distorted visitation distribution are novel, and can find applications in other risk-sensitive RL problems.