Searcharxiv⌕ Search

arXiv subjects

Bo Wu

Publications and source records attributed to Bo Wu.

At least 73 records · Page 4Linked to original sources
arXiv2024

Quasi-invariant theorem on the Gaussian path space

In this article, we will first introduce a class of Gaussian processes, and prove the quasi-invariant theorem with respect to the Gaussian Wiener measure, which is the law of the associated Gaussian process. In particular, it includes the case of the fractional Brownian motion. As applications, we will establish the integration by parts formula and Bismut-Elworthy-Li formula on the Gaussian path space, and by which some logarithmic Sobolev inequalities will be presented. Moreover, we will also provides some applications in the field of financial mathematics.

math.PR↗
arXiv2023

Efficient Segmentation with Texture in Ore Images Based on Box-supervised Approach

Image segmentation methods have been utilized to determine the particle size distribution of crushed ores. Due to the complex working environment, high-powered computing equipment is difficult to deploy. At the same time, the ore distribution is stacked, and it is difficult to identify the complete features. To address this issue, an effective box-supervised technique with texture features is provided for ore image segmentation that can identify complete and independent ores. Firstly, a ghost feature pyramid network (Ghost-FPN) is proposed to process the features obtained from the backbone to reduce redundant semantic information and computation generated by complex networks. Then, an optimized detection head is proposed to obtain the feature to maintain accuracy. Finally, Lab color space (Lab) and local binary patterns (LBP) texture features are combined to form a fusion feature similarity-based loss function to improve accuracy while incurring no loss. Experiments on MS COCO have shown that the proposed fusion features are also worth studying on other types of datasets. Extensive experimental results demonstrate the effectiveness of the proposed method, which achieves over 50 frames per second with a small model size of 21.6 MB. Meanwhile, the method maintains a high level of accuracy compared with the state-of-the-art approaches on ore image dataset. The source code is available at \url{https://github.com/MVME-HBUT/OREINST}.

cs.CV↗
arXiv2023

The NeurIPS 2022 Neural MMO Challenge: A Massively Multiagent Competition with Specialization and Trade

In this paper, we present the results of the NeurIPS-2022 Neural MMO Challenge, which attracted 500 participants and received over 1,600 submissions. Like the previous IJCAI-2022 Neural MMO Challenge, it involved agents from 16 populations surviving in procedurally generated worlds by collecting resources and defeating opponents. This year's competition runs on the latest v1.6 Neural MMO, which introduces new equipment, combat, trading, and a better scoring system. These elements combine to pose additional robustness and generalization challenges not present in previous competitions. This paper summarizes the design and results of the challenge, explores the potential of this environment as a benchmark for learning methods, and presents some practical reinforcement learning training approaches for complex tasks with sparse rewards. Additionally, we have open-sourced our baselines, including environment wrappers, benchmarks, and visualization tools for future research.

cs.AI↗
arXiv2023

Distance-Based Propagation for Efficient Knowledge Graph Reasoning

Knowledge graph completion (KGC) aims to predict unseen edges in knowledge graphs (KGs), resulting in the discovery of new facts. A new class of methods have been proposed to tackle this problem by aggregating path information. These methods have shown tremendous ability in the task of KGC. However they are plagued by efficiency issues. Though there are a few recent attempts to address this through learnable path pruning, they often sacrifice the performance to gain efficiency. In this work, we identify two intrinsic limitations of these methods that affect the efficiency and representation quality. To address the limitations, we introduce a new method, TAGNet, which is able to efficiently propagate information. This is achieved by only aggregating paths in a fixed window for each source-target pair. We demonstrate that the complexity of TAGNet is independent of the number of layers. Extensive experiments demonstrate that TAGNet can cut down on the number of propagated messages by as much as 90% while achieving competitive performance on multiple KG datasets. The code is available at https://github.com/HarryShomer/TAGNet.

cs.LG↗
arXiv2023

Evaluating Large Language Models on Graphs: Performance Insights and Comparative Analysis

Large Language Models (LLMs) have garnered considerable interest within both academic and industrial. Yet, the application of LLMs to graph data remains under-explored. In this study, we evaluate the capabilities of four LLMs in addressing several analytical problems with graph data. We employ four distinct evaluation metrics: Comprehension, Correctness, Fidelity, and Rectification. Our results show that: 1) LLMs effectively comprehend graph data in natural language and reason with graph topology. 2) GPT models can generate logical and coherent results, outperforming alternatives in correctness. 3) All examined LLMs face challenges in structural reasoning, with techniques like zero-shot chain-of-thought and few-shot prompting showing diminished efficacy. 4) GPT models often produce erroneous answers in multi-answer tasks, raising concerns in fidelity. 5) GPT models exhibit elevated confidence in their outputs, potentially hindering their rectification capacities. Notably, GPT-4 has demonstrated the capacity to rectify responses from GPT-3.5-turbo and its own previous iterations. The code is available at: https://github.com/Ayame1006/LLMtoGraph.

cs.AI↗
arXiv2023

Benchmarking Robustness and Generalization in Multi-Agent Systems: A Case Study on Neural MMO

We present the results of the second Neural MMO challenge, hosted at IJCAI 2022, which received 1600+ submissions. This competition targets robustness and generalization in multi-agent systems: participants train teams of agents to complete a multi-task objective against opponents not seen during training. The competition combines relatively complex environment design with large numbers of agents in the environment. The top submissions demonstrate strong success on this task using mostly standard reinforcement learning (RL) methods combined with domain-specific engineering. We summarize the competition design and results and suggest that, as an academic community, competitions may be a powerful approach to solving hard problems and establishing a solid benchmark for algorithms. We will open-source our benchmark including the environment wrapper, baselines, a visualization tool, and selected policies for further research.

cs.AI↗
arXiv2023

Eight-input optical programmable logic array enabled by parallel spectrum modulation

Despite over 40 years' development of optical logic computing, the studies have been still struggling to support more than four operands, since the high parallelism of light has not been fully leveraged blocked by the optical nonlinearity and redundant input modulation in existing methods. Here, we propose a scalable multi-input optical programmable logic array (PLA) with minimal logical input, enabled by parallel spectrum modulation. By making full use of the wavelength resource, an eight-input PLA is experimentally demonstrated, and there are 2^256 possible combinations of generated logic gates. Various complex logic fuctions, such as 8-256 decoder, 4-bit comparator, adder and multiplier are experimentally demonstrated via leveraging the PLA. The scale of PLA can be further extended by fully using the dimensions of wavelength and space. As an example, a nine-input PLA is implemented to realize the two-dimensional optical cellular automaton for the first time and perform Conway's Game of Life to simulate the evolutionary process of cells. Our work significantly alleviates the challenge of extensibility of optical logic devices, opening up new avenues for future large-scale, high-speed and energy-efficient optical digital computing.

cs.ET↗
arXiv2023

Redundancy-free integrated optical convolver for optical neural networks based on arrayed waveguide grating

Optical neural networks (ONNs) have gained significant attention due to their potential for high-speed and energy-efficient computation in artificial intelligence. The implementation of optical convolutions plays a vital role in ONNs, as they are fundamental operations within neural network architectures. However, state-of-the-art convolution architectures often suffer from redundant inputs, leading to substantial resource waste. Here, we propose an integrated optical convolution architecture that leverages the inherent routing principles of arrayed waveguide grating (AWG) to execute the sliding of convolution kernel and summation of results. M*N multiply-accumulate (MAC) operations are facilitated by M+N units within a single clock cycle, thus eliminating the redundancy. In the experiment, we achieved 5-bit precision and 91.9% accuracy in the handwritten digit recognition task confirming the reliability of our approach. Its redundancy-free architecture, low power consumption, high compute density (8.53 teraOP mm^-2 s^-1) and scalability make it a valuable contribution to the field of optical neural networks, thereby paving the way for future advancements in high-performance computing and artificial intelligence applications.

cs.ET↗
arXiv2023

Effect of Rydberg-atom-based sensor performance on different Rydberg atom population at one atomic-vapor cell

The atomic-vapor cell is a vital component for Rydberg atomic microwave sensors, and impacts on overall capability of Rydberg sensor. However, the conventional analysis approach on effect of vapor-cell length contains two implicit assumptions, that is, the same atomic population density and buffer gas pressure, which make it unable to accurately capture actual response about effect of Rydberg-atom-based sensor performance on different Rydberg atom population. Here, utilizing a stepped cesium atomic-vapor cell with five different dimensions at the same atomic population density and buffer gas pressure, the height and full width at half maximum of Electromagnetically Induced Transparency(EIT) signal, and the sensitivity of the atomic superheterodyne sensor are comprehensively investigated at the same Rabi frequences(saturated laser power) conditions. It is identified that EIT signal height is proportional to the cell length, full width at half maximum and sensitivity grow with the increment of cell length to a certain extent. Based on the coherent integration signal theory and atomic linear expansion coefficient method, theoretical analysis of the EIT height and sensitivity are further investigated. The results could shed new light on the understanding and design of ultrahigh-sensitivity Rydberg atomic microwave sensors and find promising applications in quantum measurement, communication, and imaging.

physics.atom-ph↗
arXiv2023

Data Cross-Segmentation for Improved Generalization in Reinforcement Learning Based Algorithmic Trading

The use of machine learning in algorithmic trading systems is increasingly common. In a typical set-up, supervised learning is used to predict the future prices of assets, and those predictions drive a simple trading and execution strategy. This is quite effective when the predictions have sufficient signal, markets are liquid, and transaction costs are low. However, those conditions often do not hold in thinly traded financial markets and markets for differentiated assets such as real estate or vehicles. In these markets, the trading strategy must consider the long-term effects of taking positions that are relatively more difficult to change. In this work, we propose a Reinforcement Learning (RL) algorithm that trades based on signals from a learned predictive model and addresses these challenges. We test our algorithm on 20+ years of equity data from Bursa Malaysia.

cs.LG↗
arXiv2023

BatchGNN: Efficient CPU-Based Distributed GNN Training on Very Large Graphs

We present BatchGNN, a distributed CPU system that showcases techniques that can be used to efficiently train GNNs on terabyte-sized graphs. It reduces communication overhead with macrobatching in which multiple minibatches' subgraph sampling and feature fetching are batched into one communication relay to reduce redundant feature fetches when input features are static. BatchGNN provides integrated graph partitioning and native GNN layer implementations to improve runtime, and it can cache aggregated input features to further reduce sampling overhead. BatchGNN achieves an average $3\times$ speedup over DistDGL on three GNN models trained on OGBN graphs, outperforms the runtimes reported by distributed GPU systems $P^3$ and DistDGLv2, and scales to a terabyte-sized graph.

cs.LG↗
arXiv2023

Chip-to-chip optical multimode communication with universal mode processors

The increasing amount of data exchange requires higher-capacity optical communication links. Mode division multiplexing (MDM) is considered as a promising technology to support the higher data throughput. In an MDM system, the mode generator and sorter are the backbone. However, most of the current schemes lack the programmability and universality, which makes the MDM link susceptible to the mode crosstalk and environmental disturbances. In this paper, we propose an intelligent multimode optical communication link using universal mode processing (generation and sorting) chips. The mode processor consists of a programmable 4*4 Mach Zehnder interferometer (MZI) network and can be intelligently configured to generate or sort both quasi linearly polarized (LP) modes and orbital angular momentum (OAM) modes in any desired routing state. We experimentally establish a chip-to-chip MDM communication system. The mode basis can be freely switched between four LP modes and four OAM modes. We also demonstrate the multimode optical communication capability at a data rate of 25 Gbit/s. The proposed scheme shows significant advantages in terms of universality, intelligence, programmability and resistance to mode crosstalk, environmental disturbances and fabrication errors, demonstrating that the MZI-based reconfigurable mode processor chip has great potential in long-distance chip-to-chip multimode optical communication systems.

physics.optics↗
arXiv2023

Learning from Children: Improving Image-Caption Pretraining via Curriculum

Image-caption pretraining has been quite successfully used for downstream vision tasks like zero-shot image classification and object detection. However, image-caption pretraining is still a hard problem -- it requires multiple concepts (nouns) from captions to be aligned to several objects in images. To tackle this problem, we go to the roots -- the best learner, children. We take inspiration from cognitive science studies dealing with children's language learning to propose a curriculum learning framework. The learning begins with easy-to-align image caption pairs containing one concept per caption. The difficulty is progressively increased with each new phase by adding one more concept per caption. Correspondingly, the knowledge acquired in each learning phase is utilized in subsequent phases to effectively constrain the learning problem to aligning one new concept-object pair in each phase. We show that this learning strategy improves over vanilla image-caption training in various settings -- pretraining from scratch, using a pretrained image or/and pretrained text encoder, low data regime etc.

cs.CV↗
arXiv2023

Learning Situation Hyper-Graphs for Video Question Answering

Answering questions about complex situations in videos requires not only capturing the presence of actors, objects, and their relations but also the evolution of these relationships over time. A situation hyper-graph is a representation that describes situations as scene sub-graphs for video frames and hyper-edges for connected sub-graphs and has been proposed to capture all such information in a compact structured form. In this work, we propose an architecture for Video Question Answering (VQA) that enables answering questions related to video content by predicting situation hyper-graphs, coined Situation Hyper-Graph based Video Question Answering (SHG-VQA). To this end, we train a situation hyper-graph decoder to implicitly identify graph representations with actions and object/human-object relationships from the input video clip. and to use cross-attention between the predicted situation hyper-graphs and the question embedding to predict the correct answer. The proposed method is trained in an end-to-end manner and optimized by a VQA loss with the cross-entropy function and a Hungarian matching loss for the situation graph prediction. The effectiveness of the proposed architecture is extensively evaluated on two challenging benchmarks: AGQA and STAR. Our results show that learning the underlying situation hyper-graphs helps the system to significantly improve its performance for novel challenges of video question-answering tasks.

cs.CV↗
arXiv2023

FR-Net:A Light-weight FFT Residual Net For Gaze Estimation

Gaze estimation is a crucial task in computer vision, however, existing methods suffer from high computational costs, which limit their practical deployment in resource-limited environments. In this paper, we propose a novel lightweight model, FR-Net, for accurate gaze angle estimation while significantly reducing computational complexity. FR-Net utilizes the Fast Fourier Transform (FFT) to extract gaze-relevant features in frequency domains while reducing the number of parameters. Additionally, we introduce a shortcut component that focuses on the spatial domain to further improve the accuracy of our model. Our experimental results demonstrate that our approach achieves substantially lower gaze error angles (3.86 on MPII and 4.51 on EYEDIAP) compared to state-of-the-art gaze estimation methods, while utilizing 17 times fewer parameters (0.67M) and only 12\% of FLOPs (0.22B). Furthermore, our method outperforms existing lightweight methods in terms of accuracy and efficiency for the gaze estimation task. These results suggest that our proposed approach has significant potential applications in areas such as human-computer interaction and driver assistance systems.

cs.CV↗
arXiv2023

Faster OreFSDet : A Lightweight and Effective Few-shot Object Detector for Ore Images

For the ore particle size detection, obtaining a sizable amount of high-quality ore labeled data is time-consuming and expensive. General object detection methods often suffer from severe over-fitting with scarce labeled data. Despite their ability to eliminate over-fitting, existing few-shot object detectors encounter drawbacks such as slow detection speed and high memory requirements, making them difficult to implement in a real-world deployment scenario. To this end, we propose a lightweight and effective few-shot detector to achieve competitive performance with general object detection with only a few samples for ore images. First, the proposed support feature mining block characterizes the importance of location information in support features. Next, the relationship guidance block makes full use of support features to guide the generation of accurate candidate proposals. Finally, the dual-scale semantic aggregation module retrieves detailed features at different resolutions to contribute with the prediction process. Experimental results show that our method consistently exceeds the few-shot detectors with an excellent performance gap on all metrics. Moreover, our method achieves the smallest model size of 19MB as well as being competitive at 50 FPS detection speed compared with general object detectors. The source code is available at https://github.com/MVME-HBUT/Faster-OreFSDet.

cs.CV↗
arXiv2023

Token-Level Supervised Contrastive Learning for Punctuation Restoration

Punctuation is critical in understanding natural language text. Currently, most automatic speech recognition (ASR) systems do not generate punctuation, which affects the performance of downstream tasks, such as intent detection and slot filling. This gives rise to the need for punctuation restoration. Recent work in punctuation restoration heavily utilizes pre-trained language models without considering data imbalance when predicting punctuation classes. In this work, we address this problem by proposing a token-level supervised contrastive learning method that aims at maximizing the distance of representation of different punctuation marks in the embedding space. The result shows that training with token-level supervised contrastive learning obtains up to 3.2% absolute F1 improvement on the test set.

cs.CL↗
arXiv2023

Logarithmic heat kernels estimates without curvature restrictions

The main results of the article are short time estimates and asymptotic estimates for the first two order derivatives of the logarithmic heat kernel of a complete Riemannian manifold. We remove all curvature restrictions and also develop several techniques. A basic tool developed here is intrinsic stochastic variations with prescribed second order covariant differentials, allowing to obtain a path integration representation for the second order derivatives of the heat semigroup $P_t$ on a complete Riemannian manifold, again without any assumptions on the curvature. The novelty is the introduction of an $ε^2$ term in the variation allowing greater control. We also construct a family of cut-off stochastic processes adapted to an exhaustion by compact subsets with smooth boundaries, each process is constructed path by path and differentiable in time, furthermore the differentials have locally uniformly bounded moments with respect to the Brownian motion measures, allowing to by-pass the lack of continuity of the exit time of the Brownian motions on its initial position.

math.PR↗