Miracle-dz/UniFAR-FTUs huggingface dataset:
Weakly Supervised Deep Functional Map for Shape Matching

A variety of deep functional maps have been proposed recently, from fully supervised to totally unsupervised, with a range of loss functions as well as different regularization terms. However, it is still not clear what are minimum ingredients of a deep functional map pipeline and whether such ingredients unify or generalize all recent work on deep functional maps. We show empirically minimum components for obtaining state of the art results with different loss functions, supervised as well as unsupervised. Furthermore, we propose a novel framework designed for both full-to-full as well as partial to full shape matching that achieves state of the art results on several benchmark datasets outperforming even the fully supervised methods by a significant margin. Our code is publicly available at this https URL
VATLD: A Visual Analytics System to Assess, Understand and Improve Traffic Light Detection

Traffic light detection is crucial for environment perception and decision-making in autonomous driving. State-of-the-art detectors are built upon deep Convolutional Neural Networks (CNNs) and have exhibited promising performance. However, one looming concern with CNN based detectors is how to thoroughly evaluate the performance of accuracy and robustness before they can be deployed to autonomous vehicles. In this work, we propose a visual analytics system, VATLD, equipped with a disentangled representation learning and semantic adversarial learning, to assess, understand, and improve the accuracy and robustness of traffic light detectors in autonomous driving applications. The disentangled representation learning extracts data semantics to augment human cognition with human-friendly visual summarization, and the semantic adversarial learning efficiently exposes interpretable robustness risks and enables minimal human interaction for actionable insights. We also demonstrate the effectiveness of various performance improvement strategies derived from actionable insights with our visual analytics system, VATLD, and illustrate some practical implications for safety-critical applications in autonomous driving.
Escaping Saddle-Points Faster under Interpolation-like Conditions

In this paper, we show that under over-parametrization several standard stochastic optimization algorithms escape saddle-points and converge to local-minimizers much faster. One of the fundamental aspects of over-parametrized models is that they are capable of interpolating the training data. We show that, under interpolation-like assumptions satisfied by the stochastic gradients in an over-parametrization setting, the first-order oracle complexity of Perturbed Stochastic Gradient Descent (PSGD) algorithm to reach an $\epsilon$-local-minimizer, matches the corresponding deterministic rate of $\tilde{\mathcal{O}}(1/\epsilon^{2})$. We next analyze Stochastic Cubic-Regularized Newton (SCRN) algorithm under interpolation-like conditions, and show that the oracle complexity to reach an $\epsilon$-local-minimizer under interpolation-like conditions, is $\tilde{\mathcal{O}}(1/\epsilon^{2.5})$. While this obtained complexity is better than the corresponding complexity of either PSGD, or SCRN without interpolation-like assumptions, it does not match the rate of $\tilde{\mathcal{O}}(1/\epsilon^{1.5})$ corresponding to deterministic Cubic-Regularized Newton method. It seems further Hessian-based interpolation-like assumptions are necessary to bridge this gap. We also discuss the corresponding improved complexities in the zeroth-order settings.
Dynamic mode decomposition to retrieve torsional Alfv\'{e}n waves

Dynamic mode decomposition (DMD) is utilised to identify the intrinsic signals arising from planetary interiors. Focusing on an axisymmetric quasi-geostrophic magnetohydrodynamic (MHD) wave -called torsional Alfven waves (TW) - we examine the utility of DMD in two types of MHD direct numerical simulations: Boussinesq magnetoconvection and anelastic convection-driven dynamos in rapidly rotating spherical shells, which model the dynamics in Earth's core and in Jupiter, respectively. We demonstrate that DMD is capable of distinguishing internal modes and boundary/interface-related modes from the timeseries of the internal velocity. Those internal modes may be realised as free TW, in terms of eigenvalues and eigenfunctions of their normal mode solutions. Meanwhile it turns out that, in order to account for the details, the global TW eigenvalue problems in spherical shells need to be further addressed.
DT-Net: A novel network based on multi-directional integrated convolution and threshold convolution

Since medical image data sets contain few samples and singular features, lesions are viewed as highly similar to other tissues. The traditional neural network has a limited ability to learn features. Even if a host of feature maps is expanded to obtain more semantic information, the accuracy of segmenting the final medical image is slightly improved, and the features are excessively redundant. To solve the above problems, in this paper, we propose a novel end-to-end semantic segmentation algorithm, DT-Net, and use two new convolution strategies to better achieve end-to-end semantic segmentation of medical images. 1. In the feature mining and feature fusion stage, we construct a multi-directional integrated convolution (MDIC). The core idea is to use the multi-scale convolution to enhance the local multi-directional feature maps to generate enhanced feature maps and to mine the generated features that contain more semantics without increasing the number of feature maps. 2. We also aim to further excavate and retain more meaningful deep features reduce a host of noise features in the training process. Therefore, we propose a convolution thresholding strategy. The central idea is to set a threshold to eliminate a large number of redundant features and reduce computational complexity. Through the two strategies proposed above, the algorithm proposed in this paper produces state-of-the-art results on two public medical image datasets. We prove in detail that our proposed strategy plays an important role in feature mining and eliminating redundant features. Compared with the existing semantic segmentation algorithms, our proposed algorithm has better robustness.
Multi-scale Receptive Fields Graph Attention Network for Point Cloud Classification

Understanding the implication of point cloud is still challenging to achieve the goal of classification or segmentation due to the irregular and sparse structure of point cloud. As we have known, PointNet architecture as a ground-breaking work for point cloud which can learn efficiently shape features directly on unordered 3D point cloud and have achieved favorable performance. However, this model fail to consider the fine-grained semantic information of local structure for point cloud. Afterwards, many valuable works are proposed to enhance the performance of PointNet by means of semantic features of local patch for point cloud. In this paper, a multi-scale receptive fields graph attention network (named after MRFGAT) for point cloud classification is proposed. By focusing on the local fine features of point cloud and applying multi attention modules based on channel affinity, the learned feature map for our network can well capture the abundant features information of point cloud. The proposed MRFGAT architecture is tested on ModelNet10 and ModelNet40 datasets, and results show it achieves state-of-the-art performance in shape classification tasks.
The Development of Visualization Psychology Analysis Tools to Account for Trust

Defining trust is an important endeavor given its applicability to assessing public mood to much of the innovation in the newly formed autonomous industry, such as artificial intelligence (AI),medical bots, drones, autonomous vehicles, and smart factories [19]. Through developing a reliable index or means to measure trust,this may have wide impact from fostering acceptance and adoption of smart systems to informing policy makers about the public atmosphere and willingness to adopt innovate change, and has been identified as an important indicator in a recent UK policy brief [8]. In this paper, we reflect on the importance and potential impact of developing Visualization Psychology in the context of solving definitions and policy decision making problems for complex constructs such as "trust".
BiteNet: Bidirectional Temporal Encoder Network to Predict Medical Outcomes

Electronic health records (EHRs) are longitudinal records of a patient's interactions with healthcare systems. A patient's EHR data is organized as a three-level hierarchy from top to bottom: patient journey - all the experiences of diagnoses and treatments over a period of time; individual visit - a set of medical codes in a particular visit; and medical code - a specific record in the form of medical codes. As EHRs begin to amass in millions, the potential benefits, which these data might hold for medical research and medical outcome prediction, are staggering - including, for example, predicting future admissions to hospitals, diagnosing illnesses or determining the efficacy of medical treatments. Each of these analytics tasks requires a domain knowledge extraction method to transform the hierarchical patient journey into a vector representation for further prediction procedure. The representations should embed a sequence of visits and a set of medical codes with a specific timestamp, which are crucial to any downstream prediction tasks. Hence, expressively powerful representations are appealing to boost learning performance. To this end, we propose a novel self-attention mechanism that captures the contextual dependency and temporal relationships within a patient's healthcare journey. An end-to-end bidirectional temporal encoder network (BiteNet) then learns representations of the patient's journeys, based solely on the proposed attention mechanism. We have evaluated the effectiveness of our methods on two supervised prediction and two unsupervised clustering tasks with a real-world EHR dataset. The empirical results demonstrate the proposed BiteNet model produces higher-quality representations than state-of-the-art baseline methods.
3-D Statistical Indoor Channel Model for Millimeter-Wave and Sub-Terahertz Bands

Millimeter-wave (mmWave) and Terahertz (THz) will be used in the sixth-generation (6G) wireless systems, especially for indoor scenarios. This paper presents an indoor three-dimensional (3-D) statistical channel model for mmWave and sub-THz frequencies, which is developed from extensive channel propagation measurements conducted in an office building at 28 GHz and 140 GHz in 2014 and 2019. Over 15,000 power delay profiles (PDPs) were recorded to study channel statistics such as the number of time clusters, cluster delays, and cluster powers. All the parameters required in the channel generation procedure are derived from empirical measurement data for 28 GHz and 140 GHz line-of-sight (LOS) and non-line-of-sight (NLOS) scenarios. The channel model is validated by showing that the simulated root mean square (RMS) delay spread and RMS angular spread yield good agreements with measured values. An indoor channel simulation software is built upon the popular NYUSIM outdoor channel simulator, which can generate realistic channel impulse response, PDP, and power angular spectrum.
Neural Baselines for Word Alignment

Word alignments identify translational correspondences between words in a parallel sentence pair and is used, for instance, to learn bilingual dictionaries, to train statistical machine translation systems, or to perform quality estimation. In most areas of natural lan- guage processing, neural network models nowadays constitute the preferred approach, a situation that might also apply to word align- ment models. In this work, we study and comprehensively evaluate neural models for unsupervised word alignment for four language pairs, contrasting several variants of neural models. We show that in most settings, neural versions of the IBM-1 and hidden Markov models vastly outperform their discrete counterparts. We also analyze typical alignment errors of the baselines that our models over- come to illustrate the benefits — and the limitations — of these new models for morphologically rich languages.
Variational Temporal Deep Generative Model for Radar HRRP Target Recognition

We develop a recurrent gamma belief network (rGBN) for radar automatic target recognition (RATR) based on high-resolution range profile (HRRP), which characterizes the temporal dependence across the range cells of HRRP. The proposed rGBN adopts a hierarchy of gamma distributions to build its temporal deep generative model. For scalable training and fast out-of-sample prediction, we propose the hybrid of a stochastic-gradient Markov chain Monte Carlo (MCMC) and a recurrent variational inference model to perform posterior inference. To utilize the label information to extract more discriminative latent representations, we further propose supervised rGBN to jointly model the HRRP samples and their corresponding labels. Experimental results on synthetic and measured HRRP data show that the proposed models are efficient in computation, have good classification accuracy and generalization ability, and provide highly interpretable multi-stochastic-layer latent structure.
Modifying a Graph's Degree Sequence and the Testablity of Degree Sequence Properties

We show that if the degree sequence of a graph $G$ is close in $\ell_1$-distance to a given realizable degree sequence $(d_1,\dots,d_n)$, then $G$ is close in edit distance to a graph with degree sequence $(d_1,\dots,d_n)$. We then use this result to prove that every graph property defined in terms of the degree sequence is testable in the dense graph model with query complexity independent of $n$.
Position-Based Multiple-Play Bandits with Thompson Sampling

Multiple-play bandits aim at displaying relevant items at relevant positions on a web page. We introduce a new bandit-based algorithm, PB-MHB, for online recommender systems which uses the Thompson sampling framework. This algorithm handles a display setting governed by the position-based model. Our sampling method does not require as input the probability of a user to look at a given position in the web page which is, in practice, very difficult to obtain. Experiments on simulated and real datasets show that our method, with fewer prior information, deliver better recommendations than state-of-the-art algorithms.
Online Learning of Non-Markovian Reward Models

There are situations in which an agent should receive rewards only after having accomplished a series of previous tasks, that is, rewards are non-Markovian. One natural and quite general way to represent history-dependent rewards is via a Mealy machine, a finite state automaton that produces output sequences from input sequences. In our formal setting, we consider a Markov decision process (MDP) that models the dynamics of the environment in which the agent evolves and a Mealy machine synchronized with this MDP to formalize the non-Markovian reward function. While the MDP is known by the agent, the reward function is unknown to the agent and must be learned. Our approach to overcome this challenge is to use Angluin's $L^*$ active learning algorithm to learn a Mealy machine representing the underlying non-Markovian reward machine (MRM). Formal methods are used to determine the optimal strategy for answering so-called membership queries posed by $L^*$. Moreover, we prove that the expected reward achieved will eventually be at least as much as a given, reasonable value provided by a domain expert. We evaluate our framework on three problems. The results show that using $L^*$ to learn an MRM in a non-Markovian reward decision process is effective.
Extended Poisson-Kac Theory: A Unifying Framework for Stochastic Processes with Finite Propagation Velocity

Stochastic processes play a key role for mathematically modeling a huge variety of transport problems out of equilibrium. To formulate models of stochastic dynamics the mainstream approach consists in superimposing random fluctuations on a suitable deterministic evolution. These fluctuations are sampled from probability distributions that are prescribed a priori, most commonly as Gaussian or Levy. While these distributions are motivated by (generalised) central limit theorems they are nevertheless unbounded. This property implies the violation of fundamental physical principles such as special relativity and may yield divergencies for basic physical quantities like energy. It is thus clearly never valid in real-world systems by rendering all these stochastic models ontologically unphysical. Here we solve the fundamental problem of unbounded random fluctuations by constructing a comprehensive theoretical framework of stochastic processes possessing finite propagation velocity. Our approach is motivated by the theory of Levy walks, which we embed into an extension of conventional Poisson-Kac processes. Our new theory possesses an intrinsic flexibility that enables the modelling of many different kinds of dynamical features, as we demonstrate by three examples. The corresponding stochastic models capture the whole spectrum of diffusive dynamics from normal to anomalous diffusion, including the striking Brownian yet non Gaussian diffusion, and more sophisticated phenomena such as senescence. Extended Poisson-Kac theory thus not only ensures by construction a mathematical representation of physical reality that is ontologically valid at all time and length scales. It also provides a toolbox of stochastic processes that can be used to model potentially any kind of finite velocity dynamical phenomena observed experimentally.
Why have a Unified Predictive Uncertainty? Disentangling it using Deep Split Ensembles

Understanding and quantifying uncertainty in black box Neural Networks (NNs) is critical when deployed in real-world settings such as healthcare. Recent works using Bayesian and non-Bayesian methods have shown how a unified predictive uncertainty can be modelled for NNs. Decomposing this uncertainty to disentangle the granular sources of heteroscedasticity in data provides rich information about its underlying causes. We propose a conceptually simple non-Bayesian approach, deep split ensemble, to disentangle the predictive uncertainties using a multivariate Gaussian mixture model. The NNs are trained with clusters of input features, for uncertainty estimates per cluster. We evaluate our approach on a series of benchmark regression datasets, while also comparing with unified uncertainty methods. Extensive analyses using dataset shits and empirical rule highlight our inherently well-calibrated models. Our work further demonstrates its applicability in a multi-modal setting using a benchmark Alzheimer's dataset and also shows how deep split ensembles can highlight hidden modality-specific biases. The minimal changes required to NNs and the training procedure, and the high flexibility to group features into clusters makes it readily deployable and useful. The source code is available at this https URL
CAT STREET: Chronicle Archive of Tokyo Street-fashion

The analysis of daily life fashion trends can help us understand our societies and human cultures profoundly. However, no appropriate database exists that includes images illustrating what people wore in their daily lives over an extended period. In this study, we propose a new fashion image archive, Chronicle Archive of Tokyo Street-fashion (CAT STREET), to shed light on daily life fashion trends. CAT STREET includes images showing what people wore in their daily lives during the period 1970-2017, and these images contain timestamps and street location annotations. This novel database enables us to observe long-term daily life fashion trends using quantitative methods. To evaluate the potential of our database, we corroborated the rules-of-thumb for two fashion trend phenomena, namely how economic conditions affect fashion style share in the long term and how fashion styles emerge in the street and diffuse from street to street. Our findings show that the Conservative style trend, a type of luxury fashion style, is affected by economic conditions. We also introduce four cases of how fashion styles emerge in the street and diffuse from street to street in fashion-conscious streets in Tokyo. Our study demonstrates CAT STREET's potential to promote understanding of societies and human cultures through quantitative analysis of daily life fashion trends.
Integrated Communication and Localization in mmWave Systems

As the fifth-generation (5G) mobile communication system is being commercialized, extensive studies on the evolution of 5G and sixth-generation mobile communication systems have been conducted. Future mobile communication systems are evidently evolving towards a more intelligent and software-reconfigurable functionality paradigm that can provide ubiquitous communication and also sense, control, and optimize wireless environments. Thus, integrating communication and localization by utilizing the highly directional transmission characteristics of millimeter-wave (mmWave) is a promising route. This approach not only expands the localization capabilities of a communication system but also provides new concepts and opportunities to enhance communication. In this paper, we explain the integrated communication and localization in mmWave systems, in which these processes share the same set of hardware architecture and algorithm. We also perform an overview of the key enabling technologies and the basic knowledge on localization. Then, we provide two promising directions for studies on localization with extremely large antenna array and model-based neural networks. We also discuss a comprehensive guidance for location-assisted mmWave communications in terms of channel estimation, channel state information feedback, beam tracking, synchronization, interference control, resource allocation, and user selection. Finally, this paper outlines the future trends on the mutual assistance and enhancement of communication and localization in integrated systems.
Machine Learning for Searching the Dark Energy Survey for Trans-Neptunian Objects

In this paper we investigate how implementing machine learning could improve the efficiency of the search for Trans-Neptunian Objects (TNOs) within Dark Energy Survey (DES) data when used alongside orbit fitting. The discovery of multiple TNOs that appear to show a similarity in their orbital parameters has led to the suggestion that one or more undetected planets, an as yet undiscovered “Planet 9”, may be present in the outer solar system. DES is well placed to detect such a planet and has already been used to discover many other TNOs. Here, we perform tests on eight different supervised machine learning algorithms, using a data set consisting of simulated TNOs buried within real DES noise data. We found that the best performing classifier was the Random Forest which, when optimized, performed well at detecting the rare objects. We achieve an area under the receiver operating characteristic (ROC) curve, (AUC) = 0.996 ± 0.001. After optimizing the decision threshold of the Random Forest, we achieve a recall of 0.96 while maintaining a precision of 0.80. Finally, by using the optimized classifier to pre-select objects, we are able to run the orbit-fitting stage of our detection pipeline five times faster.