Miracle-dz/UniFAR-FTUs huggingface dataset:
Behavioral acceptance of automated vehicles: The roles of perceived safety concern and current travel behavior

With the prospect of next-generation automated mobility ecosystem, the realization of the contended traffic efficiency and safety benefits are contingent upon the demand landscape for automated vehicles (AVs). Focusing on the public acceptance behavior of AVs, this empirical study addresses two gaps in the plethora of travel behavior research on identifying the potential determinants thereof. First, a clear behavioral understanding is lacking as to the perceived concern about AV safety and the consequent effect on AV acceptance behavior. Second, how people appraise the benefits of enhanced automated mobility to meet their current (pre-AV era) travel behavior and needs, along with the resulting impacts on AV acceptance and perceived safety concern, remain equivocal. To fill these gaps, a recursive trivariate econometric model with ordinal-continuous outcomes is employed, which jointly estimates AV acceptance (ordinal), perceived AV safety concern (ordinal), and current annual vehicle-miles traveled (VMT) approximating the current travel behavior (continuous). Importantly, the co-estimation of the three endogenous outcomes allows to capture the true interdependencies among them, net of any correlated unobserved factors that can have common impacts on these outcomes. Besides the classical socio-economic characteristics, the outcome variables are further explained by the latent preferences for vehicle attributes (including vehicle cost, reliability, performance, and refueling) and for existing shared mobility systems. The model estimation results on a stated preference survey in the State of California provide insights into proactive policies that can popularize AVs through gearing towards the most affected population groups, particularly vehicle cost-conscious, safety-concerned, and lower-VMT (such as travel-restrictive) individuals.
Designing an Encoder for Fast Personalization of Text-to-Image Models

Text-to-image personalization aims to teach a pre-trained diffusion model to reason about novel, user provided concepts, embedding them into new scenes guided by natural language prompts. However, current personalization approaches struggle with lengthy training times, high storage requirements or loss of identity. To overcome these limitations, we propose an encoder-based domain-tuning approach. Our key insight is that by underfitting on a large set of concepts from a given domain, we can improve generaliza-tion and create a model that is more amenable to quickly adding novel concepts from the same domain. Specifically, we employ two components: First, an encoder that takes as an input a single image of a target concept from a given domain, e.g . a specific face, and learns to map it into a word-embedding representing the concept. Second, a set of regularized weight-offsets for the text-to-image model that learn how to effectively ingest additional concepts. Together, these components are used to guide the learning of unseen concepts, allowing us to personalize a model using only a single image and as few as 5 training steps — accelerating personalization from dozens of minutes to seconds , while preserving quality. Code and trained encoders will be available at our project page.
Conformal field theory, solitons, and elliptic Calogero--Sutherland models

We construct a non-chiral conformal field theory (CFT) on the torus that accommodates a second quantization of the elliptic Calogero-Sutherland (eCS) model. We show that the CFT operator that provides this second quantization defines, at the same time, a quantum version of a soliton equation called the non-chiral intermediate long-wave (ncILW) equation. We also show that this CFT operator is a second quantization of a generalized eCS model which can describe arbitrary numbers of four different kinds of particles; we propose that these particles can be identified with solitons of the quantum ncILW equation.
Diverse Policy Optimization for Structured Action Space

Enhancing the diversity of policies is beneficial for robustness, exploration, and transfer in reinforcement learning (RL). In this paper, we aim to seek diverse policies in an under-explored setting, namely RL tasks with structured action spaces with the two properties of composability and local dependencies. The complex action structure, non-uniform reward landscape, and subtle hyperparameter tuning due to the properties of structured actions prevent existing approaches from scaling well. We propose a simple and effective RL method, Diverse Policy Optimization (DPO), to model the policies in structured action space as the energy-based models (EBM) by following the probabilistic RL framework. A recently proposed novel and powerful generative model, GFlowNet, is introduced as the efficient, diverse EBM-based policy sampler. DPO follows a joint optimization framework: the outer layer uses the diverse policies sampled by the GFlowNet to update the EBM-based policies, which supports the GFlowNet training in the inner layer. Experiments on ATSC and Battle benchmarks demonstrate that DPO can efficiently discover surprisingly diverse policies in challenging scenarios and substantially outperform existing state-of-the-art methods.
Can Pre-trained Vision and Language Models Answer Visual Information-Seeking Questions?

Pre-trained vision and language models have demonstrated state-of-the-art capabilities over existing tasks involving images and texts, including visual question answering. However, it remains unclear whether these models possess the capability to answer questions that are not only querying visual content but knowledge-intensive and information-seeking. In this study, we introduce InfoSeek, a visual question answering dataset tailored for information-seeking questions that cannot be answered with only common sense knowledge. Using InfoSeek, we analyze various pre-trained visual question answering models and gain insights into their characteristics. Our findings reveal that state-of-the-art pre-trained multi-modal models (e.g., PaLI-X, BLIP2, etc.) face challenges in answering visual information-seeking questions, but fine-tuning on the InfoSeek dataset elicits models to use fine-grained knowledge that was learned during their pre-training. Furthermore, we show that accurate visual entity recognition can be used to improve performance on InfoSeek by retrieving relevant documents, showing a significant space for improvement.
Guidable Local Hamiltonian Problems with Implications to Heuristic Ansätze State Preparation and the Quantum PCP Conjecture

We study 'Merlinized' versions of the recently defined Guided Local Hamiltonian problem, which we call 'Guidable Local Hamiltonian' problems. Unlike their guided counterparts, these problems do not have a guiding state provided as a part of the input, but merely come with the promise that one exists. We consider in particular two classes of guiding states: those that can be prepared efficiently by a quantum circuit; and those belonging to a class of quantum states we call classically evaluatable, for which it is possible to efficiently compute expectation values of local observables classically. We show that guidable local Hamiltonian problems for both classes of guiding states are $\mathsf{QCMA}$-complete in the inverse-polynomial precision setting, but lie within $\mathsf{NP}$ (or $\mathsf{NqP}$) in the constant precision regime when the guiding state is classically evaluatable. Our completeness results show that, from a complexity-theoretic perspective, classical Ans\"atze selected by classical heuristics are just as powerful as quantum Ans\"atze prepared by quantum heuristics, as long as one has access to quantum phase estimation. In relation to the quantum PCP conjecture, we (i) define a complexity class capturing quantum-classical probabilistically checkable proof systems and show that it is contained in $\mathsf{BQP}^{\mathsf{NP}[1]}$ for constant proof queries; (ii) give a no-go result on 'dequantizing' the known quantum reduction which maps a $\mathsf{QPCP}$-verification circuit to a local Hamiltonian with constant promise gap; (iii) give several no-go results for the existence of quantum gap amplification procedures that preserve certain ground state properties; and (iv) propose two conjectures that can be viewed as stronger versions of the NLTS theorem. Finally, we show that many of our results can be directly modified to obtain similar results for the class $\mathsf{MA}$.
On the Robustness of ChatGPT: An Adversarial and Out-of-distribution Perspective

ChatGPT is a recent chatbot service released by OpenAI and is receiving increasing attention over the past few months. While evaluations of various aspects of ChatGPT have been done, its robustness, i.e., the performance to unexpected inputs, is still unclear to the public. Robustness is of particular concern in responsible AI, especially for safety-critical applications. In this paper, we conduct a thorough evaluation of the robustness of ChatGPT from the adversarial and out-of-distribution (OOD) perspective. To do so, we employ the AdvGLUE and ANLI benchmarks to assess adversarial robustness and the Flipkart review and DDXPlus medical diagnosis datasets for OOD evaluation. We select several popular foundation models as baselines. Results show that ChatGPT shows consistent advantages on most adversarial and OOD classification and translation tasks. However, the absolute performance is far from perfection, which suggests that adversarial and OOD robustness remains a significant threat to foundation models. Moreover, ChatGPT shows astounding performance in understanding dialogue-related texts and we find that it tends to provide informal suggestions for medical tasks instead of definitive answers. Finally, we present in-depth discussions of possible research directions.
Traditional vs extended contextuality: Impossibility of accepting one while rejecting the other

Contextuality was originally deﬁned only for consistently connected systems of random variables (those without disturbance/signaling). Contextuality-by-Default theory (CbD) oﬀers an extension of the notion of contextuality to arbitrary systems, by deﬁning it in terms of the systems’ couplings subject to certain constraints. Such extensions are sometimes met with skepticism. We pose the question of whether it is possible to develop a set of substantive requirements (i.e., those addressing a notion itself rather than its presentation form) such that (a) for any consistently connected system these requirements are satisﬁed, but (2) they are violated for some inconsistently connected systems. We show that no such set of requirements is possible, not only for CbD but for all possible CbD-like extensions of contextuality. This follows from the fact that any extended contextuality theory T is contextually equivalent to a theory T ′ in which all systems are consistently connected. The contextual equivalence means the following: there is a bijective correspondence between the systems in T and T ′ such that the corresponding systems in T and T ′ are, in a well-deﬁned sense, mere reformulations of each other, and they are contextual or noncontextual together.
Symmetries of structures that fail to interpret something finite

We investigate structural implications arising from the condition that a given directed graph does not interpret, in the sense of primitive positive interpretation with parameters or orbits, every finite structure. Our results generalize several theorems from the literature and yield further algebraic invariance properties that must be satisfied in every such graph. Algebraic properties of this kind are tightly connected to the tractability of constraint satisfaction problems, and we obtain new such properties even for infinite countably categorical graphs. We balance these positive results by showing the existence of a countably categorical hypergraph that fails to interpret some finite structure, while still lacking some of the most essential algebraic invariance properties known to hold for finite structures.
Estimating the Instantaneous Reproduction Number With Imperfect Data: A Method to Account for Case-Reporting Variation and Serial Interval Uncertainty (preprint)

During an infectious disease outbreak, public health decision-makers require real-time monitoring of disease transmission to respond quickly and intelligently. In these settings, a key measure of transmission is the instantaneous time-varying reproduction number, $R_t$. Estimation of this number using a Time-Since-Infection model relies on case-notification data and the distribution of the serial interval on the target population. However, in practice, case-notification data may contain measurement error due to variation in case reporting while available serial interval estimates may come from studies on non-representative populations. We propose a new data-driven method that accounts for certain forms of case-reporting measurement error and can incorporate multiple partially representative serial interval estimates into the transmission estimation process. In addition, we provide practical tools for automatically identifying measurement error patterns and determining when measurement error may not be adequately accounted for. We illustrate the potential bias undertaken by methods that ignore these practical concerns through a variety of simulated outbreaks. We then demonstrate the use of our method on data from the COVID-19 pandemic to estimate transmission and explore the relationships between social distancing, temperature, and transmission.
Sin2ψ-based residual stress gradient analysis by energy-dispersive synchrotron diffraction constrained by small gauge volumes. I. Theoretical concept

The influence of the gauge volume size and shape on the analysis of steep near-surface residual stress gradients by means of energy-dispersive synchrotron diffraction is studied theoretically. Cases are considered where the irradiated sample volume is confined by narrow-slit systems, in both the primary and the diffracted beam, to dimensions comparable to the `natural' 1/e information depth τ1/e of the X-rays. It is shown that the ratio between τ1/e, defined by the material's absorption, and the immersion depth hGV of the gauge volume into the sample is the crucial parameter that shapes the dψhkl or ∊ψhkl versus sin2ψ distributions obtained in the Ψ mode of X-ray stress analysis. Since the actual information depth 〈z〉GV to which the measured X-ray signal has to be assigned is a superposition of geometrical and exponential weighting functions, ambiguities in the conventional plot of the Laplace stresses versus 〈z〉GV may occur for measurements performed using narrow-slit configurations. To avoid conflicts in data analysis in these cases, a modified formalism is proposed for the evaluation of the real space residual stress profiles σ||(z), which is based on a two-dimensional least-squares fit procedure.
ProsAudit, a prosodic benchmark for self-supervised speech models

We present ProsAudit, a benchmark in English to assess structural prosodic knowledge in self-supervised learning (SSL) speech models. It consists of two subtasks, their corresponding metrics, and an evaluation dataset. In the protosyntax task, the model must correctly identify strong versus weak prosodic boundaries. In the lexical task, the model needs to correctly distinguish between pauses inserted between words and within words. We also provide human evaluation scores on this benchmark. We evaluated a series of SSL models and found that they were all able to perform above chance on both tasks, even when evaluated on an unseen language. However, non-native models performed significantly worse than native ones on the lexical task, highlighting the importance of lexical knowledge in this task. We also found a clear effect of size with models trained on more data performing better in the two subtasks.
Detachedly Learn a Classifier for Class-Incremental Learning

In continual learning, model needs to continually learn a feature extractor and classifier on a sequence of tasks. This paper focuses on how to learn a classifier based on a pretrained feature extractor under continual learning setting. We present an probabilistic analysis that the failure of vanilla experience replay (ER) comes from unnecessary re-learning of previous tasks and incompetence to distinguish current task from the previous ones, which is the cause of knowledge degradation and prediction bias. To overcome these weaknesses, we propose a novel replay strategy task-aware experience replay. It rebalances the replay loss and detaches classifier weight for the old tasks from the update process, by which the previous knowledge is kept intact and the overfitting on episodic memory is alleviated. Experimental results show our method outperforms current state-of-the-art methods.
Transformers in Single Object Tracking: An Experimental Survey

Single-object tracking is a well-known and challenging research topic in computer vision. Over the last two decades, numerous researchers have proposed various algorithms to solve this problem and achieved promising results. Recently, Transformer-based tracking approaches have ushered in a new era in single-object tracking by introducing new perspectives and achieving superior tracking robustness. In this paper, we conduct an in-depth literature analysis of Transformer tracking approaches by categorizing them into CNN-Transformer based trackers, Two-stream Two-stage fully-Transformer based trackers, and One-stream One-stage fully-Transformer based trackers. In addition, we conduct experimental evaluations to assess their tracking robustness and computational efficiency using publicly available benchmark datasets. Furthermore, we measure their performances on different tracking scenarios to identify their strengths and weaknesses in particular situations. Our survey provides insights into the underlying principles of Transformer tracking approaches, the challenges they encounter, and the future directions they may take.
Bi-stability in the turbulent wake past parallelepiped bodies with various aspect ratios and wall effects

The turbulent wake past parallelepiped bodies with a rectangular blunt trailing edge of height H and width W is investigated in wall proximity: various aspect ratios H* = H/W ∈ [0.51, 1.63] and ground clearances C* = C/W ∈ [0, 1.00] are explored at a Reynolds number of 4.5 × 104 based on the body width W. Base pressure measurements and particle image velocimetry show that the close wake often undergoes antisymmetric instabilities that can be either in the lateral direction (parallel to the wall) or in the vertical direction (normal to the wall). The instantaneous wake presents preferred states with high degrees of asymmetry; in some configurations, topology shifts are observed after long time scales Tl ∼ 103W/U0 leading to bistable behaviors. The effect of ground proximity is thoroughly studied for H* = 0.74 corresponding to the reference Ahmed geometry and for a case with a height dimension larger than its width H* = 1/0.74 = 1.34. When C* > 0.08, it is found that the Ahmed body is bistable in the latera.
Artifact: A Large-Scale Dataset With Artificial And Factual Images For Generalizable And Robust Synthetic Image Detection

Synthetic image generation has opened up new opportunities but has also created threats in regard to privacy, authenticity, and security. Detecting fake images is of paramount importance to prevent illegal activities, and previous research has shown that generative models leave unique patterns in their synthetic images that can be exploited to detect them. However, the fundamental problem of generalization remains, as even state-of-the-art detectors encounter difficulty when facing generators never seen during training. To assess the generalizability and robustness of synthetic image detectors in the face of real-world impairments, this paper presents a large-scale dataset1 named ArtiFact, comprising diverse generators, object categories, and real-world challenges. Moreover, the proposed multi-class classification scheme, combined with a filter stride reduction strategy addresses social platform impairments and effectively detects synthetic images from both seen and unseen generators. The proposed solution significantly outperforms other top teams by 8.34% on Test 1, 1.26% on Test 2, and 15.08% on Test 3 in the IEEE VIP Cup challenge at ICIP 2022, as measured by the accuracy metric.
Non-Abelian currents bootstrap

We initiate the study of correlation functions of non-Abelian spin-1 conserved current in three dimensional conformal field theories using numerical conformal bootstrap. We discuss the general framework and apply it to the particular cases of $SU(N)$ and $O(N)$ global symmetry. In both cases we obtain general bounds on operator dimensions. In the large-$N$ limit our bounds show features in correspondence of the expected position of fermionic QED$_3$ in three dimensions, as well as other interesting theories. By imposing gaps inspired by the spectrum of QED$_3$ at large-$N$, we manage to restrict the plane of certain operator dimensions to a small island, where QED$_3$ must live.
LightCTS: A Lightweight Framework for Correlated Time Series Forecasting

Correlated time series (CTS) forecasting plays an essential role in many practical applications, such as traffic management and server load control. Many deep learning models have been proposed to improve the accuracy of CTS forecasting. However, while models have become increasingly complex and computationally intensive, they struggle to improve accuracy. Pursuing a different direction, this study aims instead to enable much more efficient, lightweight models that preserve accuracy while being able to be deployed on resource-constrained devices. To achieve this goal, we characterize popular CTS forecasting models and yield two observations that indicate directions for lightweight CTS forecasting. On this basis, we propose the LightCTS framework that adopts plain stacking of temporal and spatial operators instead of alternate stacking that is much more computationally expensive. Moreover, LightCTS features light temporal and spatial operator modules, called L-TCN and GL-Former, that offer improved computational efficiency without compromising their feature extraction capabilities. LightCTS also encompasses a last-shot compression scheme to reduce redundant temporal features and speed up subsequent computations. Experiments with single-step and multi-step forecasting benchmark datasets show that LightCTS is capable of nearly state-of-the-art accuracy at much reduced computational and storage overheads.
PLU-Net: Extraction of multi-scale feature fusion

In recent years, deep learning algorithms have achieved remarkable results in medical image segmentation. These networks with an enormous number of parameters often encounter challenges in handling image boundaries and details, which may result in suboptimal segmentation results. To solve the problem, we develop atrous spatial pyramid pooling (ASPP) and combine it with the squeeze-and-excitation block (SE block), as well as present the PS module, which employs a broader and multiscale receptive field at the network's bottom to obtain more detailed semantic information. We also propose the local guided block (LG block) and also its combination with the SE block to form the LS block, which can obtain more abundant local features in the feature map, so that more edge information can be retained in each down sampling process, thereby improving the performance of boundary segmentation. We propose PLU-Net and integrate our PS module and LS block into U-Net. We put our PLU-Net to the test on three benchmark datasets, and the results show that by fewer parameters and FLOPs, it outperforms on medical semantic segmentation tasks.