Searcharxiv⌕ Search

arXiv subjects

Haitao Wang

Publications and source records attributed to Haitao Wang.

At least 109 records · Page 6Linked to original sources

AudioFormer: Audio Transformer learns audio feature representations from discrete acoustic codes

We propose a method named AudioFormer,which learns audio feature representations through the acquisition of discrete acoustic codes and subsequently fine-tunes them for audio classification tasks. Initially,we introduce a novel perspective by considering the audio classification task as a form of natural language understanding (NLU). Leveraging an existing neural audio codec model,we generate discrete acoustic codes and utilize them to train a masked language model (MLM),thereby obtaining audio feature representations. Furthermore,we pioneer the integration of a Multi-Positive sample Contrastive (MPC) learning approach. This method enables the learning of joint representations among multiple discrete acoustic codes within the same audio input. In our experiments,we treat discrete acoustic codes as textual data and train a masked language model using a cloze-like methodology,ultimately deriving high-quality audio representations. Notably,the MPC learning technique effectively captures collaborative representations among distinct positive samples. Our research outcomes demonstrate that AudioFormer attains significantly improved performance compared to prevailing monomodal audio classification models across multiple datasets,and even outperforms audio-visual multimodal classification models on select datasets. Specifically,our approach achieves remarkable results on datasets including AudioSet (2M,20K),and FSD50K,with performance scores of 53.9,45.1,and 65.6,respectively. We have openly shared both the code and models: https://github.com/LZH-0225/AudioFormer.git.

cs.SD↗

Stability of background perturbation for Boltzmann equation

Consider the Boltzmann equation in the perturbation regime. Since the macroscopic quantities in the background global Maxwellian are obtained through measurements, there are typically some errors involved. This paper investigates the effect of background variations on the solution for a given initial perturbation. Our findings demonstrate that the solution changes continuously with variations in the background and provide a sharp time decay estimate of the associated errors. The proof relies on refined estimates for the linearized solution operator and a proper decomposition of the nonlinear solution.

math.AP↗

MSMix:An Interpolation-Based Text Data Augmentation Method Manifold Swap Mixup

To solve the problem of poor performance of deep neural network models due to insufficient data, a simple yet effective interpolation-based data augmentation method is proposed: MSMix (Manifold Swap Mixup). This method feeds two different samples to the same deep neural network model, and then randomly select a specific layer and partially replace hidden features at that layer of one of the samples by the counterpart of the other. The mixed hidden features are fed to the model and go through the rest of the network. Two different selection strategies are also proposed to obtain richer hidden representation. Experiments are conducted on three Chinese intention recognition datasets, and the results show that the MSMix method achieves better results than other methods in both full-sample and small-sample configurations.

cs.LG↗

Geometric Hitting Set for Line-Constrained Disks and Related Problems

Given a set $P$ of $n$ weighted points and a set $S$ of $m$ disks in the plane, the hitting set problem is to compute a subset $P'$ of points of $P$ such that each disk contains at least one point of $P'$ and the total weight of all points of $P'$ is minimized. The problem is known to be NP-hard. In this paper, we consider a line-constrained version of the problem in which all disks are centered on a line $\ell$. We present an $O((m+n)\log(m+n)+κ\log m)$ time algorithm for the problem, where $κ$ is the number of pairs of disks that intersect. For the unit-disk case where all disks have the same radius, the running time can be reduced to $O((n + m)\log(m + n))$. In addition, we solve the problem in $O((m + n)\log(m + n))$ time in the $L_{\infty}$ and $L_1$ metrics, in which a disk is a square and a diamond, respectively. Our techniques can also be used to solve other geometric hitting set problems. For example, given in the plane a set $P$ of $n$ weighted points and a set $S$ of $n$ half-planes, we solve in $O(n^4\log n)$ time the problem of finding a minimum weight hitting set of $P$ for $S$. This improves the previous best algorithm of $O(n^6)$ time by nearly a quadratic factor.

cs.CG↗

Surface structure and multigap superconductivity of V3Si (111) revealed by scanning tunneling microscopy

V3Si, a classical silicide superconductor with relatively high TC (~16 K), is promising for constructing silicon-based superconducting devices and hetero-structures. However, real space characterization on its surfaces and superconducting properties are still limited. Here we report the first low-temperature scanning tunnelling microscopy (STM) study on cleaned V3Si (111) single crystal surface. We observed a r3 by r3 superstructure which displays mirror symmetry between adjacent terraces, indicating the surface is V-terminated and reconstructed. The tunneling spectrum shows full superconducting gap with double pairs of coherence peaks, but has a relatively small gap size with comparing to bulk TC. Impurity induced in-gap state is absent on surface defects but present on introduced magnetic adatoms. Upon applying magnetic field, a hexagonal vortex lattice is visualized. Interestingly, the vortex size is found to be field dependent, and the coherence length measured from single vortex at low field is significantly larger than estimated value from bulk H_c2. These results reflect V3Si is a multi-band, s- wave superconductor.

cond-mat.supr-con↗

Statistical Dataset Evaluation: Reliability, Difficulty, and Validity

Datasets serve as crucial training resources and model performance trackers. However, existing datasets have exposed a plethora of problems, inducing biased models and unreliable evaluation results. In this paper, we propose a model-agnostic dataset evaluation framework for automatic dataset quality evaluation. We seek the statistical properties of the datasets and address three fundamental dimensions: reliability, difficulty, and validity, following a classical testing theory. Taking the Named Entity Recognition (NER) datasets as a case study, we introduce $9$ statistical metrics for a statistical dataset evaluation framework. Experimental results and human evaluation validate that our evaluation framework effectively assesses various aspects of the dataset quality. Furthermore, we study how the dataset scores on our statistical metrics affect the model performance, and appeal for dataset quality evaluation or targeted dataset improvement before training or testing models.

cs.CL↗

Computing the Minimum Bottleneck Moving Spanning Tree

Given a set $P$ of $n$ points that are moving in the plane, we consider the problem of computing a spanning tree for these moving points that does not change its combinatorial structure during the point movement. The objective is to minimize the bottleneck weight of the spanning tree (i.e., the largest Euclidean length of all edges) during the whole movement. The problem was solved in $O(n^2)$ time previously [Akitaya, Biniaz, Bose, De Carufel, Maheshwari, Silveira, and Smid, WADS 2021]. In this paper, we present a new algorithm of $O(n^{4/3} \log^3 n)$ time.

cs.CG↗

Learning Symbolic Operators: A Neurosymbolic Solution for Autonomous Disassembly of Electric Vehicle Battery

The booming of electric vehicles demands efficient battery disassembly for recycling to be environment-friendly. Currently, battery disassembly is still primarily done by humans, probably assisted by robots, due to the unstructured environment and high uncertainties. It is highly desirable to design autonomous solutions to improve work efficiency and lower human risks in high voltage and toxic environments. This paper proposes a novel neurosymbolic method, which augments the traditional Variational Autoencoder (VAE) model to learn symbolic operators based on raw sensory inputs and their relationships. The symbolic operators include a probabilistic state symbol grounding model and a state transition matrix for predicting states after each execution to enable autonomous task and motion planning. At last, the method's feasibility is verified through test results.

cs.RO↗

Autonomous Electric Vehicle Battery Disassembly Based on NeuroSymbolic Computing

The booming of electric vehicles demands efficient battery disassembly for recycling to be environment-friendly. Due to the unstructured environment and high uncertainties, battery disassembly is still primarily done by humans, probably assisted by robots. It is highly desirable to design autonomous solutions to improve work efficiency and lower human risks in high voltage and toxic environments. This paper proposes a novel framework of the NeuroSymbolic task and motion planning method to disassemble batteries in an unstructured environment using robots automatically. It enables robots to independently locate and disassemble battery bolts, with or without obstacles. This study not only provides a solution for intelligently disassembling electric vehicle batteries but also verifies its feasibility through a set of test results with the robot accomplishing the disassembly tasks in a complex and dynamic environment.

cs.RO↗

Unit-Disk Range Searching and Applications

Given a set $P$ of $n$ points in the plane, we consider the problem of computing the number of points of $P$ in a query unit disk (i.e., all query disks have the same radius). We show that the main techniques for simplex range searching in the plane can be adapted to this problem. For example, by adapting Matoušek's results, we can build a data structure of $O(n)$ space so that each query can be answered in $O(\sqrt{n})$ time. Our techniques lead to improvements for several other classical problems, such as batched range searching, counting/reporting intersecting pairs of unit circles, distance selection, discrete 2-center, etc. For example, given a set of $n$ unit disks and a set of $n$ points in the plane, the batched range searching problem is to compute for each disk the number of points in it. Previous work [Katz and Sharir, 1997] solved the problem in $O(n^{4/3}\log n)$ time while our new algorithm runs in $O(n^{4/3})$ time.

cs.CG↗

Real-space Observation of Incommensurate Spin Density Wave and Coexisting Charge Density Wave on Cr(001) surface

In itinerant magnetic systems, a spin density wave (SDW) state can be induced by Fermi surface nesting and electron-electron interaction. It may intertwine with other orders such as charge density wave (CDW), while their relation is still yet to be understood. Here via spin-polarized scanning tunneling microscopy, we directly observed long-range spin modulation on Cr(001) surface, which corresponds to the well-known incommensurate SDW of bulk Cr. It displays 6.0 nm in-plane period and anti-phase behavior between adjacent (001) planes. Meanwhile, we simultaneously observed the coexisting CDW with half the period of SDW. Such SDW/CDW have highly correlated domain structures and are in-phase. Surprisingly, the CDW displays a contrast inversion around a density-of-states dip at -22 meV, indicating an anomalous CDW gap opened below EF. These observations support that the CDW is a secondary order driven by SDW. Our work is not only a real-space characterization of incommensurate SDW, but also provides insights on how SDW and CDW coexist.

cond-mat.mtrl-sci↗

Space-time behavior of the solution to the Boltzmann equation with soft potentials

In this paper, we get the quantitative space-time behavior of the full Boltzmann equation with soft potentials ($-2<γ<0$) in the close to equilibrium setting, under some velocity decay assumption, but without any Sobolev regularity assumption on the initial data. We find that both the large time and spatial behaviors depend on the velocity decay of the initial data and the exponent $γ$. The key step in our strategy is to obtain the $L^{\infty }$ bound of a suitable weighted full Boltzmann equation directly, rather than using Green's function and Duhamel's principle to construct the pointwise structure of the solution as in the paper: T.-P. Liu and S.-H. Yu, The Green function and large time behavier of solutions for the one-dimensional Boltzmann equation, Commun. Pure App. Math.,(2004). This provides a new thinking in the related study.

math.AP↗

Reverse Shortest Path Problem for Unit-Disk Graphs

Given a set P of n points in the plane, the unit-disk graph G_{r}(P) with respect to a parameter r is an undirected graph whose vertex set is P such that an edge connects two points p, q \in P if the Euclidean distance between p and q is at most r (the weight of the edge is 1 in the unweighted case and is the distance between p and q in the weighted case). Given a value λ>0 and two points s and t of P, we consider the following reverse shortest path problem: computing the smallest r such that the shortest path length between s and t in G_r(P) is at most λ. In this paper, we present an algorithm of O(\lfloor λ\rfloor \cdot n \log n) time and another algorithm of O(n^{5/4} \log^{7/4} n) time for the unweighted case, as well as an O(n^{5/4} \log^{5/2} n) time algorithm for the weighted case. We also consider the L_1 version of the problem where the distance of two points is measured by the L_1 metric; we solve the problem in O(n \log^3 n) time for both the unweighted and weighted cases.

cs.CG↗

AMMASurv: Asymmetrical Multi-Modal Attention for Accurate Survival Analysis with Whole Slide Images and Gene Expression Data

The use of multi-modal data such as the combination of whole slide images (WSIs) and gene expression data for survival analysis can lead to more accurate survival predictions. Previous multi-modal survival models are not able to efficiently excavate the intrinsic information within each modality. Moreover, previous methods regard the information from different modalities as similarly important so they cannot flexibly utilize the potential connection between the modalities. To address the above problems, we propose a new asymmetrical multi-modal method, termed as AMMASurv. Different from previous works, AMMASurv can effectively utilize the intrinsic information within every modality and flexibly adapts to the modalities of different importance. Encouraging experimental results demonstrate the superiority of our method over other state-of-the-art methods.

cs.CV↗

Compressible Navier-Stokes equation with BV initial data: Part II. Global stability

In previous work \cite{W-Y-Z-local}, we studied the local well-posedness of weak solution to the 1-D full compressible Navier-Stokes equation with initial data of small total variation. Specifically, the local existence, the regularity, and the uniqueness in certain function space of the weak solution have been established. The basis for the previous study is the precise construction of fundamental solution for heat equation with BV conductivity. In this paper, we continue to investigate the global stability and the time asymptotic behavior of the weak solution. The main step is to construct the ``effective Green's function'', which is the combination of the heat kernel with BV coefficient in short time and the Green's function around constant state in long time. The former one captures the quasi-linear nature of the system, while the latter one respects the dissipative structure. Then the weak solution is written into an integral system in terms of this ``effective Green's function'', and the time asymptotic behavior is established based on a priori estimate.

math.AP↗

A Simple Algorithm for Computing the Zone of a Line in an Arrangement of Lines

Let $L$ be a set of $n$ lines in the plane. The zone $Z(\ell)$ of a line $\ell$ in the arrangement $\mathcal{A}(L)$ of $L$ is the set of faces of $\mathcal{A}(L)$ whose closure intersects $\ell$. It is known that the combinatorial size of $Z(\ell)$ is $O(n)$. Given $L$ and $\ell$, computing $Z(\ell)$ is a fundamental problem. Linear-time algorithms exist for computing $Z(\ell)$ if $\mathcal{A}(L)$ has already been built, but building $\mathcal{A}(L)$ takes $O(n^2)$ time. On the other hand, $O(n\log n)$-time algorithms are also known for computing $Z(\ell)$ without relying on $\mathcal{A}(L)$, but these algorithms are relatively complicated. In this paper, we present a simple algorithm that can compute $Z(\ell)$ in $O(n\log n)$ time. More specifically, once the sorted list of the intersections between $\ell$ and the lines of $L$ is known, the algorithm runs in $O(n)$ time. A big advantage of our algorithm, which mainly involves a Graham's scan style procedure, is its simplicity.

cs.CG↗

Constructing Many Faces in Arrangements of Lines and Segments

We present new algorithms for computing many faces in arrangements of lines and segments. Given a set $S$ of $n$ lines (resp., segments) and a set $P$ of $m$ points in the plane, the problem is to compute the faces of the arrangements of $S$ that contain at least one point of $P$. For the line case, we give a deterministic algorithm of $O(m^{2/3}n^{2/3}\log^{2/3} (n/\sqrt{m})+(m+n)\log n)$ time. This improves the previously best deterministic algorithm [Agarwal, 1990] by a factor of $\log^{2.22}n$ and improves the previously best randomized algorithm [Agarwal, Matoušek, and Schwarzkopf, 1998] by a factor of $\log^{1/3}n$ in certain cases (e.g., when $m=Θ(n)$). For the segment case, we present a deterministic algorithm of $O(n^{2/3}m^{2/3}\log n+τ(nα^2(n)+n\log m+m)\log n)$ time, where $τ=\min\{\log m,\log (n/\sqrt{m})\}$ and $α(n)$ is the inverse Ackermann function. This improves the previously best deterministic algorithm [Agarwal, 1990] by a factor of $\log^{2.11}n$ and improves the previously best randomized algorithm [Agarwal, Matoušek, and Schwarzkopf, 1998] by a factor of $\log n$ in certain cases (e.g., when $m=Θ(n)$). We also give a randomized algorithm of $O(m^{2/3}K^{1/3}\log n+τ(nα(n)+n\log m+m)\log n\log K)$ expected time, where $K$ is the number of intersections of all segments of $S$. In addition, we consider the query version of the problem, that is, preprocess $S$ to compute the face of the arrangement of $S$ that contains any query point. We present new results that improve the previous work for both the line and the segment cases.

cs.CG↗

Shortest Paths Among Obstacles in the Plane Revisited

Given a set of pairwise disjoint polygonal obstacles in the plane, finding an obstacle-avoiding Euclidean shortest path between two points is a classical problem in computational geometry and has been studied extensively. The previous best algorithm was given by Hershberger and Suri [FOCS 1993, SIAM J. Comput. 1999] and the algorithm runs in $O(n\log n)$ time and $O(n\log n)$ space, where $n$ is the total number of vertices of all obstacles. The algorithm is time-optimal because $Ω(n\log n)$ is a lower bound. It has been an open problem for over two decades whether the space can be reduced to $O(n)$. In this paper, we settle it by solving the problem in $O(n\log n)$ time and $O(n)$ space, which is optimal in both time and space; we achieve this by modifying the algorithm of Hershberger and Suri. Like their original algorithm, our new algorithm can build a shortest path map for a source point $s$ in $O(n\log n)$ time and $O(n)$ space, such that given any query point $t$, the length of a shortest path from $s$ to $t$ can be computed in $O(\log n)$ time and a shortest path can be produced in additional time linear in the number of edges of the path.

cs.CG↗