208,500 results on '"An Hoang"'
Search Results
152. Tree-Sliced Wasserstein Distance on a System of Lines
- Author
-
Tran, Viet-Hoang, Pham, Trang, Tran, Tho, Le, Tam, and Nguyen, Tan M.
- Subjects
Computer Science - Machine Learning ,Computer Science - Artificial Intelligence ,Statistics - Machine Learning - Abstract
Sliced Wasserstein (SW) distance in Optimal Transport (OT) is widely used in various applications thanks to its statistical effectiveness and computational efficiency. On the other hand, Tree Wassenstein (TW) and Tree-sliced Wassenstein (TSW) are instances of OT for probability measures where its ground cost is a tree metric. TSW also has a low computational complexity, i.e. linear to the number of edges in the tree. Especially, TSW is identical to SW when the tree is a chain. While SW is prone to loss of topological information of input measures due to relying on one-dimensional projection, TSW is more flexible and has a higher degree of freedom by choosing a tree rather than a line to alleviate the curse of dimensionality in SW. However, for practical applications, popular tree metric sampling methods are heavily built upon given supports, which limits their capacity to adapt to new supports. In this paper, we propose the Tree-Sliced Wasserstein distance on a System of Lines (TSW-SL), which brings a connection between SW and TSW. Compared to SW and TSW, our TSW-SL benefits from the higher degree of freedom of TSW while being suitable to dynamic settings as SW. In TSW-SL, we use a variant of the Radon Transform to project measures onto a system of lines, resulting in measures on a space with a tree metric, then leverage TW to efficiently compute distances between them. We empirically verify the advantages of TSW-SL over the traditional SW by conducting a variety of experiments on gradient flows, image style transfer, and generative models., Comment: 33 pages, 6 figures, 2 tables, 4 algorithms
- Published
- 2024
153. Electric field enhances the electronic and diffusion properties of penta-graphene nanoribbons for application in lithium-ion batteries: a first-principles study
- Author
-
Tran, Thi Nhan, Duy, Nguyen Vo Anh, Hieu, Nguyen Hoang, Nguyen, Truc Anh, Van, Nguyen To, Phung, Viet Bac Thi, Schall, Peter, and Dang, Minh Triet
- Subjects
Condensed Matter - Materials Science ,Physics - Computational Physics - Abstract
Enhancing the electronic and diffusion properties of lithium-ion batteries is crucial for improving the performance of the fast-growing energy storage devices. Recently, fast-charging capability of commercial-like lithium-ion anodes with the least modification of the current manufactoring technology is of great interest. Here we use first principles methods with density functional theory and the climbing image-nudged elastic band method to evaluate the impact of an external electric field on the stability, electronic and diffusion properties of penta-graphene nanoribbons upon lithium adsorption. We show that by adsorbing a lithium atom, these semiconductor nanoribbons become metal with a formation energy of - 0.22 (eV). The lithium-ion mobility of this material is comparable to that of a common carbon graphite layer. Under a relatively small vertical electric field, the structural stability of these lithium-ion systems is even more stable, and their diffusion coefficient is enhanced significantly of ~719 times higher than that of the material in the absence of an applied electric field and ~521 times higher than in the case of commercial graphitic carbon layers. Our results highlight the role of an external electric field as a novel switch to improve the efficiency of lithium-ion batteries with penta-graphene nanoribbon electrodes and open a new horizon for the use of more environmentally friendly pentagonal materials as anode materials in lithium-ion battery industry., Comment: 21 pages, 5 figures
- Published
- 2024
154. Block Circulant Codes with Application to Decentralized Systems
- Author
-
Sasidharan, Birenjith, Viterbo, Emanuele, and Dau, Son Hoang
- Subjects
Computer Science - Information Theory ,Computer Science - Cryptography and Security - Abstract
The structure of linear dependence relations between coded symbols of a linear code, irrespective of specific coefficients involved, is referred to as the {\em topology} of the code. The specification of coefficients is referred to as an {\em instantiation} of the topology. In this paper, we propose a new block circulant topology $T_{[\mu,\lambda,\omega]}(\rho)$ parameterized by integers $\rho \geq 2$, $\omega \geq 1$, $\lambda \geq 2$, and $\mu$ a multiple of $\lambda$. In this topology, the code has $\mu$ local codes with $\rho$ parity-check (p-c) constraints and a total of $\mu\rho$ p-c equations fully define the code. Next, we construct a class of block circulant (BC) codes ${\cal C}_{\text{BC}}[\mu,\lambda,\omega,\rho]$ with blocklength $n=\mu(\rho+\omega)$, dimension $k=\mu\omega$ that instantiate $T_{[\mu,\lambda,\omega]}(\rho)$. Every local code of ${\cal C}_{\text{BC}}[\mu,\lambda,\omega,\rho]$ is a $[\rho+\lambda\omega,\lambda\omega,\rho+1]$ generalized Reed-Solomon (RS) code. The overlap between supports of local codes helps to enhance the minimum distance $\rho+1$ to $2\rho+1$, without compromising much on the rate. We provide an efficient, parallelizable decoding algorithm to correct $2\rho$ erasures when $\lambda=2$. Finally, we illustrate that the BC codes serve as a viable alternative to 2D RS codes in protocols designed to tackle blockchain networks' data availability (DA) problem. In these protocols, every node in a network of light nodes randomly queries symbols from a codeword stored in full nodes and verifies them using a cryptographic commitment scheme. For the same performance in tackling the DA problem, the BC code requires querying a smaller number of symbols than a comparable 2D RS code for a fixed high rate. Furthermore, the number of local codes in the BC code is typically smaller, yielding a reduction in the complexity of realizing the commitment scheme.
- Published
- 2024
155. Convergence rates of S.O.S hierarchies for polynomial semidefinite programs
- Author
-
Tran, Hoang Anh and Toh, Kim-Chuan
- Subjects
Mathematics - Optimization and Control ,90C22, 90C26, 41A10, 41A50 - Abstract
We introduce a S.O.S hierarchy of lower bounds for a polynomial optimization problem whose constraint is expressed as a matrix polynomial semidefinite condition. Our approach involves utilizing a penalty function framework to directly address the matrix-based constraint, making it applicable to both discrete and continuous polynomial optimization problems. We investigate the convergence rates of these bounds in both problem types. The proposed method yields a variation of Putinar's theorem tailored for positive polynomials within a compact semidefinite set, defined by a matrix polynomial semidefinite constraint. More specifically, we derive novel insights into the convergence rates and degree of additional terms in the representation within this modified version of Putinar's theorem, based on the Jackson's theorem and a version of {\L}ojasiewicz inequality.
- Published
- 2024
156. BSRBF-KAN: A combination of B-splines and Radial Basis Functions in Kolmogorov-Arnold Networks
- Author
-
Ta, Hoang-Thang
- Subjects
Computer Science - Computation and Language - Abstract
In this paper, we introduce BSRBF-KAN, a Kolmogorov Arnold Network (KAN) that combines B-splines and radial basis functions (RBFs) to fit input vectors during data training. We perform experiments with BSRBF-KAN, multi-layer perception (MLP), and other popular KANs, including EfficientKAN, FastKAN, FasterKAN, and GottliebKAN over the MNIST and Fashion-MNIST datasets. BSRBF-KAN shows stability in 5 training runs with a competitive average accuracy of 97.55% on MNIST and 89.33% on Fashion-MNIST and obtains convergence better than other networks. We expect BSRBF-KAN to open many combinations of mathematical functions to design KANs. Our repo is publicly available at: https://github.com/hoangthangta/BSRBF_KAN., Comment: 8 pages, 1 figure, 3 tables
- Published
- 2024
157. Positive Steady-State Varieties of Small Chemical Reaction Networks
- Author
-
Curiel, Maize, Farr, Elise, Fries, Galileo, Puente, Luis David García, Hutchins, Julian, and Hoang, Vuong Nguyen
- Subjects
Mathematics - Algebraic Geometry ,65H10, 92E20, 12D10 - Abstract
Chemical reaction network theory is a field of applied mathematics concerned with modeling chemical systems, and can be used in other contexts such as in systems biology to study cellular signaling pathways or epidemiology to study the effect of human interaction on the spread of disease. In this paper, we seek to understand a chemical reaction network's equilibrium points through the lens of algebraic geometry by computing the positive part of the steady-state variety defined by polynomial equations arising from the assumption of mass-action kinetics. We provide a systematic classification of positive steady-state varieties produced by 2-species, 2-reaction networks, grounded in combinatorial and algebraic properties. While some (restricted) techniques exist to fully understand the ideal defining the positive steady-state variety, this computation presents a significant challenge in general. Our classification theorems provide a simplification of previous criteria, and aim to provide a foundation for future analysis of larger networks.
- Published
- 2024
158. Enhancing Domain Adaptation through Prompt Gradient Alignment
- Author
-
Phan, Hoang, Tran, Lam, Tran, Quyen, and Le, Trung
- Subjects
Computer Science - Machine Learning ,Computer Science - Computer Vision and Pattern Recognition - Abstract
Prior Unsupervised Domain Adaptation (UDA) methods often aim to train a domain-invariant feature extractor, which may hinder the model from learning sufficiently discriminative features. To tackle this, a line of works based on prompt learning leverages the power of large-scale pre-trained vision-language models to learn both domain-invariant and specific features through a set of domain-agnostic and domain-specific learnable prompts. Those studies typically enforce invariant constraints on representation, output, or prompt space to learn such prompts. Differently, we cast UDA as a multiple-objective optimization problem in which each objective is represented by a domain loss. Under this new framework, we propose aligning per-objective gradients to foster consensus between them. Additionally, to prevent potential overfitting when fine-tuning this deep learning architecture, we penalize the norm of these gradients. To achieve these goals, we devise a practical gradient update procedure that can work under both single-source and multi-source UDA. Empirically, our method consistently surpasses other prompt-based baselines by a large margin on different UDA benchmarks, Comment: 26 pages, 4 figures, 4 tables
- Published
- 2024
159. SR-CACO-2: A Dataset for Confocal Fluorescence Microscopy Image Super-Resolution
- Author
-
Belharbi, Soufiane, Whitford, Mara KM, Hoang, Phuong, Murtaza, Shakeeb, McCaffrey, Luke, and Granger, Eric
- Subjects
Electrical Engineering and Systems Science - Image and Video Processing ,Computer Science - Computer Vision and Pattern Recognition ,Computer Science - Machine Learning - Abstract
Confocal fluorescence microscopy is one of the most accessible and widely used imaging techniques for the study of biological processes. Scanning confocal microscopy allows the capture of high-quality images from 3D samples, yet suffers from well-known limitations such as photobleaching and phototoxicity of specimens caused by intense light exposure, which limits its use in some applications, especially for living cells. Cellular damage can be alleviated by changing imaging parameters to reduce light exposure, often at the expense of image quality. Machine/deep learning methods for single-image super-resolution (SISR) can be applied to restore image quality by upscaling lower-resolution (LR) images to produce high-resolution images (HR). These SISR methods have been successfully applied to photo-realistic images due partly to the abundance of publicly available data. In contrast, the lack of publicly available data partly limits their application and success in scanning confocal microscopy. In this paper, we introduce a large scanning confocal microscopy dataset named SR-CACO-2 that is comprised of low- and high-resolution image pairs marked for three different fluorescent markers. It allows the evaluation of performance of SISR methods on three different upscaling levels (X2, X4, X8). SR-CACO-2 contains the human epithelial cell line Caco-2 (ATCC HTB-37), and it is composed of 22 tiles that have been translated in the form of 9,937 image patches for experiments with SISR methods. Given the new SR-CACO-2 dataset, we also provide benchmarking results for 15 state-of-the-art methods that are representative of the main SISR families. Results show that these methods have limited success in producing high-resolution textures, indicating that SR-CACO-2 represents a challenging problem. Our dataset, code and pretrained weights are available: https://github.com/sbelharbi/sr-caco-2., Comment: 23 pages, 13 figures
- Published
- 2024
160. Language-Driven Closed-Loop Grasping with Model-Predictive Trajectory Replanning
- Author
-
Nguyen, Huy Hoang, Vu, Minh Nhat, Beck, Florian, Ebmer, Gerald, Nguyen, Anh, and Kugi, Andreas
- Subjects
Computer Science - Robotics - Abstract
Combining a vision module inside a closed-loop control system for a \emph{seamless movement} of a robot in a manipulation task is challenging due to the inconsistent update rates between utilized modules. This task is even more difficult in a dynamic environment, e.g., objects are moving. This paper presents a \emph{modular} zero-shot framework for language-driven manipulation of (dynamic) objects through a closed-loop control system with real-time trajectory replanning and an online 6D object pose localization. We segment an object within $\SI{0.5}{\second}$ by leveraging a vision language model via language commands. Then, guided by natural language commands, a closed-loop system, including a unified pose estimation and tracking and online trajectory planning, is utilized to continuously track this object and compute the optimal trajectory in real-time. Our proposed zero-shot framework provides a smooth trajectory that avoids jerky movements and ensures the robot can grasp a non-stationary object. Experiment results exhibit the real-time capability of the proposed zero-shot modular framework for the trajectory optimization module to accurately and efficiently grasp moving objects, i.e., up to \SI{30}{\hertz} update rates for the online 6D pose localization module and \SI{10}{\hertz} update rates for the receding-horizon trajectory optimization. These advantages highlight the modular framework's potential applications in robotics and human-robot interaction; see the video in https://www.acin.tuwien.ac.at/en/6e64/., Comment: 9 pages, 6 figures
- Published
- 2024
161. Laser-target symmetry-breaking in high harmonic generation: from frequency shift to odd-even intensity modulation
- Author
-
Trieu, Doan-An, Le, Van-Hoang, and Phan, Ngoc-Loan
- Subjects
Physics - Optics ,Quantum Physics - Abstract
Although the frequency shift and odd-even intensity modulation in high-order harmonic generation (HHG) have both been observed for asymmetric laser-target systems, they are typically studied as two separate phenomena. In this Letter, we provide a comprehensive picture of these two nonlinear optical phenomena, unifying them through a common origin - asymmetry of the laser-target system. By tuning asymmetric laser-target systems, we discover a transition from the harmonic frequency shift to the odd-even intensity modulation upon increasing the duration of the driving laser pulse. Specifically, these phenomena are observed simultaneously for laser pulses with intermediate pulse duration. For numerical evidence, we solve the time-dependent Schr\"{o}dinger equation, while insight into the underlying physics is obtained from a simplified analytically tractable model. Understanding the asymmetric characteristics reflected in the HHG as provided is crucial for retrieving laser-target information, sampling external fields, and probing molecular dynamics., Comment: 6 pages, 4 figures
- Published
- 2024
162. LLM-assisted Concept Discovery: Automatically Identifying and Explaining Neuron Functions
- Author
-
Hoang-Xuan, Nhat, Vu, Minh, and Thai, My T.
- Subjects
Computer Science - Computer Vision and Pattern Recognition - Abstract
Providing textual concept-based explanations for neurons in deep neural networks (DNNs) is of importance in understanding how a DNN model works. Prior works have associated concepts with neurons based on examples of concepts or a pre-defined set of concepts, thus limiting possible explanations to what the user expects, especially in discovering new concepts. Furthermore, defining the set of concepts requires manual work from the user, either by directly specifying them or collecting examples. To overcome these, we propose to leverage multimodal large language models for automatic and open-ended concept discovery. We show that, without a restricted set of pre-defined concepts, our method gives rise to novel interpretable concepts that are more faithful to the model's behavior. To quantify this, we validate each concept by generating examples and counterexamples and evaluating the neuron's response on this new set of images. Collectively, our method can discover concepts and simultaneously validate them, providing a credible automated tool to explain deep neural networks.
- Published
- 2024
163. Effective Polaron Dynamics of an Impurity Particle Interacting with a Fermi Gas
- Author
-
Hoang, Duc Viet and Pickl, Peter
- Subjects
Mathematical Physics ,Condensed Matter - Quantum Gases - Abstract
We study the quantum dynamics of a homogeneous ideal Fermi gas coupled to an impurity particle on a three-dimensional box with periodic boundary condition. For large Fermi momentum $k_\text{F}$, we prove that the effective dynamics is generated by a Fr\"ohlich-type polaron Hamiltonian, which linearly couples the impurity particle to an almost-bosonic excitation field. Moreover, we prove that the effective dynamics can be approximated by an explicit coupled coherent state. Our method is applicable to two relevant settings: first, an interaction coupling $\lambda=1$ and masses of order 1 for time scales of order $k_\text{F}^{-1}$; second to the case of $\lambda=k_\text{F}^{-1}$ and a heavy Fermi gas with masses of order $k_\text{F}$ for time scales of order 1., Comment: 39 pages, 1 figure
- Published
- 2024
164. CHARME: A chain-based reinforcement learning approach for the minor embedding problem
- Author
-
Ngo, Hoang M., Do, Nguyen H K., Vu, Minh N., Kahveci, Tamer, and Thai, My T.
- Subjects
Computer Science - Artificial Intelligence ,Computer Science - Machine Learning - Abstract
Quantum Annealing (QA) holds great potential for solving combinatorial optimization problems efficiently. However, the effectiveness of QA algorithms heavily relies on the embedding of problem instances, represented as logical graphs, into the quantum unit processing (QPU) whose topology is in form of a limited connectivity graph, known as the minor embedding Problem. Existing methods for the minor embedding problem suffer from scalability issues when confronted with larger problem sizes. In this paper, we propose a novel approach utilizing Reinforcement Learning (RL) techniques to address the minor embedding problem, named CHARME. CHARME includes three key components: a Graph Neural Network (GNN) architecture for policy modeling, a state transition algorithm ensuring solution validity, and an order exploration strategy for effective training. Through comprehensive experiments on synthetic and real-world instances, we demonstrate that the efficiency of our proposed order exploration strategy as well as our proposed RL framework, CHARME. In details, CHARME yields superior solutions compared to fast embedding methods such as Minorminer and ATOM. Moreover, our method surpasses the OCT-based approach, known for its slower runtime but high-quality solutions, in several cases. In addition, our proposed exploration enhances the efficiency of the training of the CHARME framework by providing better solutions compared to the greedy strategy.
- Published
- 2024
165. pVACview: an interactive visualization tool for efficient neoantigen prioritization and selection
- Author
-
Xia, Huiming, Hoang, My, Schmidt, Evelyn, Kiwala, Susanna, McMichael, Joshua, Skidmore, Zachary L., Fisk, Bryan, Song, Jonathan J., Hundal, Jasreet, Mooney, Thomas, Walker, Jason R., Goedegebuure, S. Peter, Miller, Christopher A., Gillanders, William E., Griffith, Obi L., and Griffith, Malachi
- Subjects
Quantitative Biology - Genomics - Abstract
Neoantigen targeting therapies including personalized vaccines have shown promise in the treatment of cancers. Accurate identification/prioritization of neoantigens is highly relevant to designing clinical trials, predicting treatment response, and understanding mechanisms of resistance. With the advent of massively parallel sequencing technologies, it is now possible to predict neoantigens based on patient-specific variant information. However, numerous factors must be considered when prioritizing neoantigens for use in personalized therapies. Complexities such as alternative transcript annotations, various binding, presentation and immunogenicity prediction algorithms, and variable peptide lengths/registers all potentially impact the neoantigen selection process. While computational tools generate numerous algorithmic predictions for neoantigen characterization, results from these pipelines are difficult to navigate and require extensive knowledge of the underlying tools for accurate interpretation. Due to the intricate nature and number of salient neoantigen features, presenting all relevant information to facilitate candidate selection for downstream applications is a difficult challenge that current tools fail to address. We have created pVACview, the first interactive tool designed to aid in the prioritization and selection of neoantigen candidates for personalized neoantigen therapies. pVACview has a user-friendly and intuitive interface where users can upload, explore, select and export their neoantigen candidates. The tool allows users to visualize candidates using variant, transcript and peptide information. pVACview will allow researchers to analyze and prioritize neoantigen candidates with greater efficiency and accuracy in basic and translational settings. The application is available as part of the pVACtools pipeline at pvactools.org and as an online server at pvacview.org., Comment: Supplemental tables available at 10.5281/zenodo.11534338
- Published
- 2024
166. Data Augmentation for Multivariate Time Series Classification: An Experimental Study
- Author
-
Ilbert, Romain, Hoang, Thai V., and Zhang, Zonghua
- Subjects
Computer Science - Machine Learning - Abstract
Our study investigates the impact of data augmentation on the performance of multivariate time series models, focusing on datasets from the UCR archive. Despite the limited size of these datasets, we achieved classification accuracy improvements in 10 out of 13 datasets using the Rocket and InceptionTime models. This highlights the essential role of sufficient data in training effective models, paralleling the advancements seen in computer vision. Our work delves into adapting and applying existing methods in innovative ways to the domain of multivariate time series classification. Our comprehensive exploration of these techniques sets a new standard for addressing data scarcity in time series analysis, emphasizing that diverse augmentation strategies are crucial for unlocking the potential of both traditional and deep learning models. Moreover, by meticulously analyzing and applying a variety of augmentation techniques, we demonstrate that strategic data enrichment can enhance model accuracy. This not only establishes a benchmark for future research in time series analysis but also underscores the importance of adopting varied augmentation approaches to improve model performance in the face of limited data availability., Comment: Workshop on Multivariate Time Series Analytics (MulTiSA), ICDE Workshop
- Published
- 2024
167. I-MPN: Inductive Message Passing Network for Efficient Human-in-the-Loop Annotation of Mobile Eye Tracking Data
- Author
-
Le, Hoang H., Nguyen, Duy M. H., Bhatti, Omair Shahzad, Kopacsi, Laszlo, Ngo, Thinh P., Nguyen, Binh T., Barz, Michael, and Sonntag, Daniel
- Subjects
Computer Science - Computer Vision and Pattern Recognition - Abstract
Comprehending how humans process visual information in dynamic settings is crucial for psychology and designing user-centered interactions. While mobile eye-tracking systems combining egocentric video and gaze signals can offer valuable insights, manual analysis of these recordings is time-intensive. In this work, we present a novel human-centered learning algorithm designed for automated object recognition within mobile eye-tracking settings. Our approach seamlessly integrates an object detector with a spatial relation-aware inductive message-passing network (I-MPN), harnessing node profile information and capturing object correlations. Such mechanisms enable us to learn embedding functions capable of generalizing to new object angle views, facilitating rapid adaptation and efficient reasoning in dynamic contexts as users navigate their environment. Through experiments conducted on three distinct video sequences, our interactive-based method showcases significant performance improvements over fixed training/testing algorithms, even when trained on considerably smaller annotated samples collected through user feedback. Furthermore, we demonstrate exceptional efficiency in data annotation processes and surpass prior interactive methods that use complete object detectors, combine detectors with convolutional networks, or employ interactive video segmentation., Comment: Updated version
- Published
- 2024
168. Stronger, Cheaper and Demonstration-Free Log Parsing with LLMs
- Author
-
Xiao, Yi, Le, Van-Hoang, and Zhang, Hongyu
- Subjects
Computer Science - Software Engineering - Abstract
Log parsing, the process of converting raw log messages into structured formats, is an important initial step for automated analysis of logs of large-scale software systems. Traditional log parsers often rely on heuristics or handcrafted features, which may not generalize well across diverse log sources or require extensive model tuning. Recently, some log parsers have utilized powerful generative capabilities of large language models (LLMs). However, they heavily rely on demonstration examples, resulting in substantial overhead in LLM invocations. To address these issues, we propose LogBatcher, a cost-effective LLM-based log parser that requires no training process or labeled data. To leverage latent characteristics of log data and reduce the overhead, we divide logs into several partitions through clustering. Then we perform a cache matching process to match logs with previously parsed log templates. Finally, we provide LLMs with better prompt context specialized for log parsing by batching a group of logs from each partition. We have conducted experiments on 16 public log datasets and the results show that LogBatcher is effective and efficient for log parsing.
- Published
- 2024
169. Description Boosting for Zero-Shot Entity and Relation Classification
- Author
-
Picco, Gabriele, Fuchs, Leopold, Galindo, Marcos Martínez, Purpura, Alberto, López, Vanessa, and Lam, Hoang Thanh
- Subjects
Computer Science - Computation and Language ,Computer Science - Information Retrieval ,Computer Science - Machine Learning - Abstract
Zero-shot entity and relation classification models leverage available external information of unseen classes -- e.g., textual descriptions -- to annotate input text data. Thanks to the minimum data requirement, Zero-Shot Learning (ZSL) methods have high value in practice, especially in applications where labeled data is scarce. Even though recent research in ZSL has demonstrated significant results, our analysis reveals that those methods are sensitive to provided textual descriptions of entities (or relations). Even a minor modification of descriptions can lead to a change in the decision boundary between entity (or relation) classes. In this paper, we formally define the problem of identifying effective descriptions for zero shot inference. We propose a strategy for generating variations of an initial description, a heuristic for ranking them and an ensemble method capable of boosting the predictions of zero-shot models through description enhancement. Empirical results on four different entity and relation classification datasets show that our proposed method outperform existing approaches and achieve new SOTA results on these datasets under the ZSL settings. The source code of the proposed solutions and the evaluation framework are open-sourced.
- Published
- 2024
170. The LiteBIRD mission to explore cosmic inflation
- Author
-
Ghigna, T., Adler, A., Aizawa, K., Akamatsu, H., Akizawa, R., Allys, E., Anand, A., Aumont, J., Austermann, J., Azzoni, S., Baccigalupi, C., Ballardini, M., Banday, A. J., Barreiro, R. B., Bartolo, N., Basak, S., Basyrov, A., Beckman, S., Bersanelli, M., Bortolami, M., Bouchet, F., Brinckmann, T., Campeti, P., Carinos, E., Carones, A., Casas, F. J., Cheung, K., Chinone, Y., Clermont, L., Columbro, F., Coppolecchia, A., Curtis, D., de Bernardis, P., de Haan, T., de la Hoz, E., De Petris, M., Della Torre, S., Monache, G. Delle, Di Giorgi, E., Dickinson, C., Diego-Palazuelos, P., García, J. J. Díaz, Dobbs, M., Dotani, T., D'Alessandro, G., Eriksen, H. K., Errard, J., Essinger-Hileman, T., Farias, N., Ferreira, E., Franceschet, C., Fuskeland, U., Galloni, G., Galloway, M., Ganga, K., Gerbino, M., Gervasi, M., Génova-Santos, R. T., Giardiello, S., Gimeno-Amo, C., Gjerløw, E., González, R. González, Grandsire, L., Gruppuso, A., Halverson, N. W., Hargrave, P., Harper, S. E., Hazumi, M., Henrot-Versillé, S., Hergt, L. T., Herranz, D., Hivon, E., Hlozek, R. A., Hoang, T. D., Hubmayr, J., Ichiki, K., Ikuma, K., Ishino, H., Jaehnig, G., Jost, B., Kohri, K., Konishi, K., Lamagna, L., Lattanzi, M., Leloup, C., Levrier, F., Lonappan, A. I., Luzzi, G., Macias-Perez, J., Maffei, B., Marchitelli, E., Martínez-González, E., Masi, S., Matarrese, S., Matsumura, T., Micheli, S., Migliaccio, M., Monelli, M., Montier, L., Morgante, G., Mousset, L., Nagano, Y., Nagata, R., Natoli, P., Novelli, A., Noviello, F., Obata, I., Occhiuzzi, A., Odagiri, K., Omae, R., Pagano, L., Paiella, A., Paoletti, D., Pascual-Cisneros, G., Patanchon, G., Pavlidou, V., Piacentini, F., Piat, M., Piccirilli, G., Pinchera, M., Pisano, G., Porcelli, L., Raffuzzi, N., Raum, C., Remazeilles, M., Ritacco, A., Rubino-Martin, J., Ruiz-Granda, M., Sakurai, Y., Savini, G., Scott, D., Sekimoto, Y., Shiraishi, M., Signorelli, G., Stever, S. L., Sullivan, R. M., Suzuki, A., Takaku, R., Takakura, H., Takakura, S., Tartari, Y. Takase. A., Tassis, K., Thompson, K. L., Tomasi, M., Tristram, M., Tucker, C., Vacher, L., van Tent, B., Vielva, P., Watanuki, K., Wehus, I. K., Westbrook, B., Weymann-Despres, G., Winter, B., Wollack, E. J., Zacchei, A., Zannoni, M., Zhou, Y., and Collaboration, the LiteBIRD
- Subjects
Astrophysics - Instrumentation and Methods for Astrophysics ,Astrophysics - Cosmology and Nongalactic Astrophysics ,Physics - Instrumentation and Detectors - Abstract
LiteBIRD, the next-generation cosmic microwave background (CMB) experiment, aims for a launch in Japan's fiscal year 2032, marking a major advancement in the exploration of primordial cosmology and fundamental physics. Orbiting the Sun-Earth Lagrangian point L2, this JAXA-led strategic L-class mission will conduct a comprehensive mapping of the CMB polarization across the entire sky. During its 3-year mission, LiteBIRD will employ three telescopes within 15 unique frequency bands (ranging from 34 through 448 GHz), targeting a sensitivity of 2.2\,$\mu$K-arcmin and a resolution of 0.5$^\circ$ at 100\,GHz. Its primary goal is to measure the tensor-to-scalar ratio $r$ with an uncertainty $\delta r = 0.001$, including systematic errors and margin. If $r \geq 0.01$, LiteBIRD expects to achieve a $>5\sigma$ detection in the $\ell=$2-10 and $\ell=$11-200 ranges separately, providing crucial insight into the early Universe. We describe LiteBIRD's scientific objectives, the application of systems engineering to mission requirements, the anticipated scientific impact, and the operations and scanning strategies vital to minimizing systematic effects. We will also highlight LiteBIRD's synergies with concurrent CMB projects., Comment: 23 pages, 9 figures, 1 table, SPIE Astronomical Telescopes + Instrumentation 2024
- Published
- 2024
171. Random Subspace Local Projections
- Author
-
Dinh, Viet Hoang, Nibbering, Didier, and Wong, Benjamin
- Subjects
Economics - Econometrics - Abstract
We show how random subspace methods can be adapted to estimating local projections with many controls. Random subspace methods have their roots in the machine learning literature and are implemented by averaging over regressions estimated over different combinations of subsets of these controls. We document three key results: (i) Our approach can successfully recover the impulse response functions across Monte Carlo experiments representative of different macroeconomic settings and identification schemes. (ii) Our results suggest that random subspace methods are more accurate than other dimension reduction methods if the underlying large dataset has a factor structure similar to typical macroeconomic datasets such as FRED-MD. (iii) Our approach leads to differences in the estimated impulse response functions relative to benchmark methods when applied to two widely studied empirical applications.
- Published
- 2024
172. Diffusion-Inspired Quantum Noise Mitigation in Parameterized Quantum Circuits
- Author
-
Nguyen, Hoang-Quan, Nguyen, Xuan Bac, Chen, Samuel Yen-Chi, Churchill, Hugh, Borys, Nicholas, Khan, Samee U., and Luu, Khoa
- Subjects
Quantum Physics ,Computer Science - Machine Learning - Abstract
Parameterized Quantum Circuits (PQCs) have been acknowledged as a leading strategy to utilize near-term quantum advantages in multiple problems, including machine learning and combinatorial optimization. When applied to specific tasks, the parameters in the quantum circuits are trained to minimize the target function. Although there have been comprehensive studies to improve the performance of the PQCs on practical tasks, the errors caused by the quantum noise downgrade the performance when running on real quantum computers. In particular, when the quantum state is transformed through multiple quantum circuit layers, the effect of the quantum noise happens cumulatively and becomes closer to the maximally mixed state or complete noise. This paper studies the relationship between the quantum noise and the diffusion model. Then, we propose a novel diffusion-inspired learning approach to mitigate the quantum noise in the PQCs and reduce the error for specific tasks. Through our experiments, we illustrate the efficiency of the learning strategy and achieve state-of-the-art performance on classification tasks in the quantum noise scenarios.
- Published
- 2024
173. Non-geodesically-convex optimization in the Wasserstein space
- Author
-
Luu, Hoang Phuc Hau, Yu, Hanlin, Williams, Bernardo, Mikkola, Petrus, Hartmann, Marcelo, Puolamäki, Kai, and Klami, Arto
- Subjects
Mathematics - Optimization and Control ,Computer Science - Machine Learning - Abstract
We study a class of optimization problems in the Wasserstein space (the space of probability measures) where the objective function is \emph{nonconvex} along generalized geodesics. When the regularization term is the negative entropy, the optimization problem becomes a sampling problem where it minimizes the Kullback-Leibler divergence between a probability measure (optimization variable) and a target probability measure whose logarithmic probability density is a nonconvex function. We derive multiple convergence insights for a novel {\em semi Forward-Backward Euler scheme} under several nonconvex (and possibly nonsmooth) regimes. Notably, the semi Forward-Backward Euler is just a slight modification of the Forward-Backward Euler whose convergence is -- to our knowledge -- still unknown in our very general non-geodesically-convex setting.
- Published
- 2024
174. Quantum Visual Feature Encoding Revisited
- Author
-
Nguyen, Xuan-Bac, Nguyen, Hoang-Quan, Churchill, Hugh, Khan, Samee U., and Luu, Khoa
- Subjects
Quantum Physics ,Computer Science - Computer Vision and Pattern Recognition - Abstract
Although quantum machine learning has been introduced for a while, its applications in computer vision are still limited. This paper, therefore, revisits the quantum visual encoding strategies, the initial step in quantum machine learning. Investigating the root cause, we uncover that the existing quantum encoding design fails to ensure information preservation of the visual features after the encoding process, thus complicating the learning process of the quantum machine learning models. In particular, the problem, termed "Quantum Information Gap" (QIG), leads to a gap of information between classical and corresponding quantum features. We provide theoretical proof and practical demonstrations of that found and underscore the significance of QIG, as it directly impacts the performance of quantum machine learning algorithms. To tackle this challenge, we introduce a simple but efficient new loss function named Quantum Information Preserving (QIP) to minimize this gap, resulting in enhanced performance of quantum machine learning algorithms. Extensive experiments validate the effectiveness of our approach, showcasing superior performance compared to current methodologies and consistently achieving state-of-the-art results in quantum modeling., Comment: Accepted to Quantum Machine Intelligence
- Published
- 2024
175. QClusformer: A Quantum Transformer-based Framework for Unsupervised Visual Clustering
- Author
-
Nguyen, Xuan-Bac, Nguyen, Hoang-Quan, Chen, Samuel Yen-Chi, Khan, Samee U., Churchill, Hugh, and Luu, Khoa
- Subjects
Computer Science - Computer Vision and Pattern Recognition - Abstract
Unsupervised vision clustering, a cornerstone in computer vision, has been studied for decades, yielding significant outcomes across numerous vision tasks. However, these algorithms involve substantial computational demands when confronted with vast amounts of unlabeled data. Conversely, quantum computing holds promise in expediting unsupervised algorithms when handling large-scale databases. In this study, we introduce QClusformer, a pioneering Transformer-based framework leveraging quantum machines to tackle unsupervised vision clustering challenges. Specifically, we design the Transformer architecture, including the self-attention module and transformer blocks, from a quantum perspective to enable execution on quantum hardware. In addition, we present QClusformer, a variant based on the Transformer architecture, tailored for unsupervised vision clustering tasks. By integrating these elements into an end-to-end framework, QClusformer consistently outperforms previous methods running on classical computers. Empirical evaluations across diverse benchmarks, including MS-Celeb-1M and DeepFashion, underscore the superior performance of QClusformer compared to state-of-the-art methods.
- Published
- 2024
176. Extended Shock Breakout and Early Circumstellar Interaction in SN 2024ggi
- Author
-
Shrestha, Manisha, Bostroem, K. Azalee, Sand, David J., Hosseinzadeh, Griffin, Andrews, Jennifer E., Dong, Yize, Hoang, Emily, Janzen, Daryl, Pearson, Jeniveve, Jencson, Jacob E., Lundquist, M. J., Mehta, Darshana, Ravi, Aravind P., Retamal, Nicolas Meza, Valenti, Stefano, Brown, Peter J., Jha, Saurabh W., Macrie, Colin, Hsu, Brian, Farah, Joseph, Howell, D. Andrew, McCully, Curtis, Newsome, Megan, Gonzalez, Estefania Padilla, Pellegrino, Craig, Terreran, Giacomo, Kwok, Lindsey, Smith, Nathan, Schwab, Michaela, Martas, Aidan, Munoz, Ricardo R., Medina, Gustavo E., Li, Ting S., Diaz, Paula, Hiramatsu, Daichi, Tucker, Brad E., Wheeler, J. C., Wang, Xiaofeng, Zhai, Qian, Zhang, Jujia, Gangopadhyay, Anjasha, Yang, Yi, and Gutierez, Claudia P.
- Subjects
Astrophysics - High Energy Astrophysical Phenomena - Abstract
We present high-cadence photometric and spectroscopic observations of supernova (SN) 2024ggi, a Type II SN with flash spectroscopy features which exploded in the nearby galaxy NGC 3621 at $\sim$7 Mpc. The light-curve evolution over the first 30 hours can be fit by two power law indices with a break after 22 hours, rising from $M_V \approx -12.95$ mag at +0.66 days to $M_V \approx -17.91$ mag after 7 days. In addition, the densely sampled color curve shows a strong blueward evolution over the first few days and then behaves as a normal SN II with a redward evolution as the ejecta cool. Such deviations could be due to interaction with circumstellar material (CSM). Early high- and low-resolution spectra clearly show high-ionization flash features from the first spectrum to +3.42 days after the explosion. From the high-resolution spectra, we calculate the CSM velocity to be 37 $\pm~4~\mathrm{km\,s^{-1}} $. We also see the line strength evolve rapidly from 1.22 to 1.49 days in the earliest high-resolution spectra. Comparison of the low-resolution spectra with CMFGEN models suggests that the pre-explosion mass-loss rate of SN 2024ggi falls in a range of $10^{-3}$ to $10^{-2}$ M$_{\odot}$ yr$^{-1}$, which is similar to that derived for SN 2023ixf. However, the rapid temporal evolution of the narrow lines in the spectra of SN 2024ggi ($R_\mathrm{CSM} \sim 2.7 \times 10^{14} \mathrm{cm}$) could indicate a smaller spatial extent of the CSM than in SN 2023ixf ($R_\mathrm{CSM} \sim 5.4 \times 10^{14} \mathrm{cm}$) which in turn implies lower total CSM mass for SN 2024ggi., Comment: 23 pages, 15 figures, 4 tables, accepted for publication in ApJL
- Published
- 2024
177. A Retrospective of the Tutorial on Opportunities and Challenges of Online Deep Learning
- Author
-
Kulbach, Cedric, Cazzonelli, Lucas, Ngo, Hoang-Anh, Le-Nguyen, Minh-Huong, and Bifet, Albert
- Subjects
Computer Science - Machine Learning - Abstract
Machine learning algorithms have become indispensable in today's world. They support and accelerate the way we make decisions based on the data at hand. This acceleration means that data structures that were valid at one moment could no longer be valid in the future. With these changing data structures, it is necessary to adapt machine learning (ML) systems incrementally to the new data. This is done with the use of online learning or continuous ML technologies. While deep learning technologies have shown exceptional performance on predefined datasets, they have not been widely applied to online, streaming, and continuous learning. In this retrospective of our tutorial titled Opportunities and Challenges of Online Deep Learning held at ECML PKDD 2023, we provide a brief overview of the opportunities but also the potential pitfalls for the application of neural networks in online learning environments using the frameworks River and Deep-River., Comment: Accepted for publication on ECML-PKDD 2023 joint Post-Workshop Proceeding
- Published
- 2024
178. Image-level Regression for Uncertainty-aware Retinal Image Segmentation
- Author
-
Dang, Trung, Nguyen, Huy Hoang, and Tiulpin, Aleksei
- Subjects
Computer Science - Computer Vision and Pattern Recognition - Abstract
Accurate retinal vessel (RV) segmentation is a crucial step in the quantitative assessment of retinal vasculature, which is needed for the early detection of retinal diseases and other conditions. Numerous studies have been conducted to tackle the problem of segmenting vessels automatically using a pixel-wise classification approach. The common practice of creating ground truth labels is to categorize pixels as foreground and background. This approach is, however, biased, and it ignores the uncertainty of a human annotator when it comes to annotating e.g. thin vessels. In this work, we propose a simple and effective method that casts the RV segmentation task as an image-level regression. For this purpose, we first introduce a novel Segmentation Annotation Uncertainty-Aware (SAUNA) transform, which adds pixel uncertainty to the ground truth using the pixel's closeness to the annotation boundary and vessel thickness. To train our model with soft labels, we generalize the earlier proposed Jaccard metric loss to arbitrary hypercubes for soft Jaccard index (Intersection-over-Union) optimization. Additionally, we employ a stable version of the Focal-L1 loss for pixel-wise regression. We conduct thorough experiments and compare our method to a diverse set of baselines across 5 retinal image datasets. Our empirical results indicate that the integration of the SAUNA transform and these segmentation losses led to significant performance boosts for different segmentation models. Particularly, our methodology enables UNet-like architectures to substantially outperform computational-intensive baselines. Our implementation is available at \url{https://github.com/Oulu-IMEDS/SAUNA}., Comment: 13 pages
- Published
- 2024
179. SiNGR: Brain Tumor Segmentation via Signed Normalized Geodesic Transform Regression
- Author
-
Dang, Trung, Nguyen, Huy Hoang, and Tiulpin, Aleksei
- Subjects
Computer Science - Computer Vision and Pattern Recognition - Abstract
One of the primary challenges in brain tumor segmentation arises from the uncertainty of voxels close to tumor boundaries. However, the conventional process of generating ground truth segmentation masks fails to treat such uncertainties properly. Those "hard labels" with 0s and 1s conceptually influenced the majority of prior studies on brain image segmentation. As a result, tumor segmentation is often solved through voxel classification. In this work, we instead view this problem as a voxel-level regression, where the ground truth represents a certainty mapping from any pixel to the border of the tumor. We propose a novel ground truth label transformation, which is based on a signed geodesic transform, to capture the uncertainty in brain tumors' vicinity. We combine this idea with a Focal-like regression L1-loss that enables effective regression learning in high-dimensional output space by appropriately weighting voxels according to their difficulty. We thoroughly conduct an experimental evaluation to validate the components of our proposed method, compare it to a diverse array of state-of-the-art segmentation models, and show that it is architecture-agnostic. The code of our method is made publicly available (\url{https://github.com/Oulu-IMEDS/SiNGR/})., Comment: Accepted as a conference paper at MICCAI 2024
- Published
- 2024
180. Hypergraph Laplacian Eigenmaps and Face Recognition Problems
- Author
-
Tran, Loc Hoang
- Subjects
Computer Science - Computer Vision and Pattern Recognition ,Computer Science - Machine Learning - Abstract
Face recognition is a very important topic in data science and biometric security research areas. It has multiple applications in military, finance, and retail, to name a few. In this paper, the novel hypergraph Laplacian Eigenmaps will be proposed and combine with the k nearest-neighbor method and/or with the kernel ridge regression method to solve the face recognition problem. Experimental results illustrate that the accuracy of the combination of the novel hypergraph Laplacian Eigenmaps and one specific classification system is similar to the accuracy of the combination of the old symmetric normalized hypergraph Laplacian Eigenmaps method and one specific classification system.
- Published
- 2024
181. Quantitative stability for the complex Monge-Amp\`ere equations I
- Author
-
Do, Hoang-Son and Vu, Duc-Viet
- Subjects
Mathematics - Complex Variables ,Mathematics - Analysis of PDEs - Abstract
We generalize several known stability estimates for complex Monge-Amp\`ere equations to the setting of low (or high) energy potentials. We apply our estimates to obtain, among other things, a quantitative domination principle, and metric properties of the space of potentials of finite energy. Further applications will be given in subsequent papers., Comment: Part I of arXiv:2209.00248, to appear in Analysis & PDE
- Published
- 2024
182. Learning to Discretize Denoising Diffusion ODEs
- Author
-
Tong, Vinh, Hoang, Trung-Dung, Liu, Anji, Broeck, Guy Van den, and Niepert, Mathias
- Subjects
Computer Science - Machine Learning - Abstract
Diffusion Probabilistic Models (DPMs) are generative models showing competitive performance in various domains, including image synthesis and 3D point cloud generation. Sampling from pre-trained DPMs involves multiple neural function evaluations (NFE) to transform Gaussian noise samples into images, resulting in higher computational costs compared to single-step generative models such as GANs or VAEs. Therefore, reducing the number of NFEs while preserving generation quality is crucial. To address this, we propose LD3, a lightweight framework designed to learn the optimal time discretization for sampling. LD3 can be combined with various samplers and consistently improves generation quality without having to retrain resource-intensive neural networks. We demonstrate analytically and empirically that LD3 improves sampling efficiency with much less computational overhead. We evaluate our method with extensive experiments on 7 pre-trained models, covering unconditional and conditional sampling in both pixel-space and latent-space DPMs. We achieve FIDs of 2.38 (10 NFE), and 2.27 (10 NFE) on unconditional CIFAR10 and AFHQv2 in 5-10 minutes of training. LD3 offers an efficient approach to sampling from pre-trained diffusion models. Code is available at https://github.com/vinhsuhi/LD3/tree/main.
- Published
- 2024
183. Leveraging knowledge distillation for partial multi-task learning from multiple remote sensing datasets
- Author
-
Lê, Hoàng-Ân and Pham, Minh-Tan
- Subjects
Computer Science - Computer Vision and Pattern Recognition - Abstract
Partial multi-task learning where training examples are annotated for one of the target tasks is a promising idea in remote sensing as it allows combining datasets annotated for different tasks and predicting more tasks with fewer network parameters. The na\"ive approach to partial multi-task learning is sub-optimal due to the lack of all-task annotations for learning joint representations. This paper proposes using knowledge distillation to replace the need of ground truths for the alternate task and enhance the performance of such approach. Experiments conducted on the public ISPRS 2D Semantic Labeling Contest dataset show the effectiveness of the proposed idea on partial multi-task learning for semantic tasks including object detection and semantic segmentation in aerial images., Comment: Accepted for oral presentation at IGARSS 2024
- Published
- 2024
184. OptLLM: Optimal Assignment of Queries to Large Language Models
- Author
-
Liu, Yueyue, Zhang, Hongyu, Miao, Yuantian, Le, Van-Hoang, and Li, Zhiqiang
- Subjects
Computer Science - Software Engineering ,Computer Science - Computation and Language ,Computer Science - Machine Learning - Abstract
Large Language Models (LLMs) have garnered considerable attention owing to their remarkable capabilities, leading to an increasing number of companies offering LLMs as services. Different LLMs achieve different performance at different costs. A challenge for users lies in choosing the LLMs that best fit their needs, balancing cost and performance. In this paper, we propose a framework for addressing the cost-effective query allocation problem for LLMs. Given a set of input queries and candidate LLMs, our framework, named OptLLM, provides users with a range of optimal solutions to choose from, aligning with their budget constraints and performance preferences, including options for maximizing accuracy and minimizing cost. OptLLM predicts the performance of candidate LLMs on each query using a multi-label classification model with uncertainty estimation and then iteratively generates a set of non-dominated solutions by destructing and reconstructing the current solution. To evaluate the effectiveness of OptLLM, we conduct extensive experiments on various types of tasks, including text classification, question answering, sentiment analysis, reasoning, and log parsing. Our experimental results demonstrate that OptLLM substantially reduces costs by 2.40% to 49.18% while achieving the same accuracy as the best LLM. Compared to other multi-objective optimization algorithms, OptLLM improves accuracy by 2.94% to 69.05% at the same cost or saves costs by 8.79% and 95.87% while maintaining the highest attainable accuracy., Comment: This paper is accepted by ICWS 2024
- Published
- 2024
185. Distributed Harmonization: Federated Clustered Batch Effect Adjustment and Generalization
- Author
-
Hoang, Bao, Pang, Yijiang, Liang, Siqi, Zhan, Liang, Thompson, Paul, and Zhou, Jiayu
- Subjects
Computer Science - Machine Learning - Abstract
Independent and identically distributed (i.i.d.) data is essential to many data analysis and modeling techniques. In the medical domain, collecting data from multiple sites or institutions is a common strategy that guarantees sufficient clinical diversity, determined by the decentralized nature of medical data. However, data from various sites are easily biased by the local environment or facilities, thereby violating the i.i.d. rule. A common strategy is to harmonize the site bias while retaining important biological information. The ComBat is among the most popular harmonization approaches and has recently been extended to handle distributed sites. However, when faced with situations involving newly joined sites in training or evaluating data from unknown/unseen sites, ComBat lacks compatibility and requires retraining with data from all the sites. The retraining leads to significant computational and logistic overhead that is usually prohibitive. In this work, we develop a novel Cluster ComBat harmonization algorithm, which leverages cluster patterns of the data in different sites and greatly advances the usability of ComBat harmonization. We use extensive simulation and real medical imaging data from ADNI to demonstrate the superiority of the proposed approach. Our codes are provided in https://github.com/illidanlab/distributed-cluster-harmonization., Comment: 11 pages, 7 figures, accepted to KDD2024-ADS
- Published
- 2024
- Full Text
- View/download PDF
186. Determining $\alpha_s(m_Z)$ from Thrust with Power Corrections
- Author
-
Benitez-Rathgeb, Miguel A., Hoang, André H., Mateu, Vicent, Stewart, Iain W., and Vita, Gherardo
- Subjects
High Energy Physics - Phenomenology - Abstract
We update and extend a previous N$^3$LL$^\prime$+${\cal O}(\alpha_s^3)$ strong coupling determination from thrust data. In particular, we carry out a fit with data fully restricted to the dijet region seeking to minimize the potential impact of power corrections that go beyond dijet configurations. In addition, we parametrize deviations from the dijet power correction in order to add an additional source of uncertainty in the result for $\alpha_s(m_Z)$. We also show that the inclusion of resummation is important to achieve stability with respect to varying the fit region., Comment: 4 pages, 3 figures. Contribution to the 2024 QCD session of the 58th Rencontres de Moriond
- Published
- 2024
187. Causal Energy-Momentum Tensors and Relativistic Fluids
- Author
-
Hoang, Vu
- Subjects
General Relativity and Quantum Cosmology ,Mathematical Physics - Abstract
In this paper, we consider a theory defined by an energy-momentum tensor depending on a set of general fields, including the space-time metric. We prove that if the theory is causal, bounded and transforms appropriately under diffeomorphism, it will depend only on the local values of the independent fields and their covariant derivatives up to a finite order. The implications are that the energy-momentum tensor of a causal relativistic fluid can only depend on covariant derivatives only up to a finite order.
- Published
- 2024
188. RecGPT: Generative Pre-training for Text-based Recommendation
- Author
-
Ngo, Hoang and Nguyen, Dat Quoc
- Subjects
Computer Science - Information Retrieval ,Computer Science - Computation and Language - Abstract
We present the first domain-adapted and fully-trained large language model, RecGPT-7B, and its instruction-following variant, RecGPT-7B-Instruct, for text-based recommendation. Experimental results on rating prediction and sequential recommendation tasks show that our model, RecGPT-7B-Instruct, outperforms previous strong baselines. We are releasing our RecGPT models as well as their pre-training and fine-tuning datasets to facilitate future research and downstream applications in text-based recommendation. Public "huggingface" links to our RecGPT models and datasets are available at: https://github.com/VinAIResearch/RecGPT, Comment: Accepted to the ACL 2024 main conference
- Published
- 2024
189. Sparse Attention-driven Quality Prediction for Production Process Optimization in Digital Twins
- Author
-
Yin, Yanlei, Wang, Lihua, Hoang, Dinh Thai, Wang, Wenbo, and Niyato, Dusit
- Subjects
Computer Science - Machine Learning ,Electrical Engineering and Systems Science - Systems and Control - Abstract
In the process industry, long-term and efficient optimization of production lines requires real-time monitoring and analysis of operational states to fine-tune production line parameters. However, complexity in operational logic and intricate coupling of production process parameters make it difficult to develop an accurate mathematical model for the entire process, thus hindering the deployment of efficient optimization mechanisms. In view of these difficulties, we propose to deploy a digital twin of the production line by encoding its operational logic in a data-driven approach. By iteratively mapping the real-world data reflecting equipment operation status and product quality indicators in the digital twin, we adopt a quality prediction model for production process based on self-attention-enabled temporal convolutional neural networks. This model enables the data-driven state evolution of the digital twin. The digital twin takes a role of aggregating the information of actual operating conditions and the results of quality-sensitive analysis, which facilitates the optimization of process production with virtual-reality evolution. Leveraging the digital twin as an information-flow carrier, we extract temporal features from key process indicators and establish a production process quality prediction model based on the proposed deep neural network. Our operation experiments on a specific tobacco shredding line demonstrate that the proposed digital twin-based production process optimization method fosters seamless integration between virtual and real production lines. This integration achieves an average operating status prediction accuracy of over 98% and a product quality acceptance rate of over 96%.
- Published
- 2024
190. On critical double phase problems in $\mathbb{R}^N$ involving variable exponents
- Author
-
Ha, Hoang Hai and Ho, Ky
- Subjects
Mathematics - Analysis of PDEs ,35J20, 35J60, 35J70, 47J10, 46E35 - Abstract
We establish a Lions-type concentration-compactness principle and its variant at infinity for Musielak-Orlicz-Sobolev spaces associated with a double phase operator with variable exponents. Based on these principles, we demonstrate the existence and concentration of solutions for a class of critical double phase equations of Schr\"odinger type in $\mathbb{R}^N$ involving variable exponents with various types of potentials. Our growth condition is more appropriately suited compared to the existing works.
- Published
- 2024
191. Time-reversed information flow through a wormhole in scalar-tensor gravity
- Author
-
Nguyen, Hoang Ky and Lobo, Francisco S. N.
- Subjects
General Relativity and Quantum Cosmology ,High Energy Physics - Theory ,Mathematical Physics - Abstract
This Letter aims to advance unexplored properties of a new class of Closed Timelike Curves recently discovered in scalar-tensor gravity, reported in Universe 9, 467 (2023) and Eur.$\,$Phys.$\,$J.$\,$C 83, 626 (2023). Therein, it was shown that when the Weak Energy Condition is violated, the topology of spacetime in scalar-tensor gravity is altered, enabling the formation of two-way traversable wormholes. Furthermore, each of these wormholes acts a gateway between two $\textit{time-mirrored}$ worlds, where the two asymptotically flat sheets in the Kruskal-Szekeres diagram are glued antipodally along $\textit{three}$ directions -- time $t$ and the polar and azimuth angles $(\theta,\,\varphi)$ of the 2-sphere -- to form a wormhole throat. This contrasts with the standard embedding diagram which typically glues the sheets only along the $\theta$ and $\varphi$ directions. Crucially, due to the `gluing' along the $t$ direction, the wormhole becomes a portal connecting the two spacetime sheets with $\textit{opposite}$ physical time flows, enabling the emergence of closed timelike loops which straddle the throat. We shall point out that this portal $\textit{mathematically}$ permits the possibility of backward propagation of information $\textit{against}$ time. This feature is ubiquitous for wormholes in scalar-tensor theories. In addition, we formulate the Feynman sum for transition amplitudes of microscopic particles in the proximity of a wormhole throat in which we account for timelike paths that experience time reversal., Comment: To appear in Phys. Lett. B; 6 pages, 5 figures; slight revisions for clarification, with references added
- Published
- 2024
- Full Text
- View/download PDF
192. Analytically controlling laser-induced electron phase in sub-cycle motion
- Author
-
Trieu, Doan-An, Nguyen, Trong-Thanh D., Nguyen, Thanh-Duy D., Tran, Thanh, Le, Van-Hoang, and Phan, Ngoc-Loan
- Subjects
Physics - Optics ,Quantum Physics - Abstract
Precise control of the electron phase accumulated during its sub-cycle motion within intense laser fields is essential in strong-field physics, yet remains mostly indirect and complicated so far. In this Letter, we develop a novel approach to control this sub-cycle electron phase by tuning a low-frequency electric field applied on a centrosymmetric gaseous target during its interaction with a few-cycle infrared laser pulse. Our method is based on a universal analytical relation between the low-frequency electric field and its induced harmonic frequency shift, derived by the strong-field approximation. This simple relation and its universality are confirmed numerically by directly solving the time-dependent Schr\"odinger equation. Moreover, we discuss the benefits of the discovered relation in \textit{in situ} applications, including continuously and precisely tuning XUV waves and developing a new method of comprehensively sampling THz pulse., Comment: 6 pages, 3 figures
- Published
- 2024
193. Observational test of ${\cal R}^{2}$ spacetimes with the S2 star in the Milky Way galactic center
- Author
-
Yan, Jian-Ming, Zhu, Tao, Azreg-Aïnou, Mustapha, Jamil, Mubasher, and Nguyen, Hoang Ky
- Subjects
General Relativity and Quantum Cosmology - Abstract
A novel class of vacuum metrics expressible in analytical form was recently found for pure $\mathcal R^2$ gravity, based on a groundwork put forth by Buchdahl in 1962. These Buchdahl-inspired solutions offer a practical framework for testing ${\cal R}^2$ gravity through empirical observations. Within a subclass of asymptotically flat Buchdahl-inspired vacuum spacetimes, we identified a parameter $\epsilon$ measuring the deviation from the classic Schwarzschild metric, which corresponds to $\epsilon=0$. In this paper, we employ observational data from the S2 star's orbit around Sgr A* in the Milky Way galactic center and perform Monte Carlo Markov Chain simulations to probe the effects of the new metrics on the orbit of the S2 star. Our analysis presented herein reports a range at 95\% confidence level on the deviation parameter as $\epsilon\in(-0.6690,\ 0.4452)$. While no decisive evidence either in favor or in disfavor of the asymptotically flat Buchdahl-inspired spacetimes has been achieved, the obtained bound is compatible with the tighter results using other data of different nature as recently reported in Eur.\,Phys.\,J.\,C $\bf 84$, 330 (2024). As a meaningful test probing into a strong-field regime, our present study calls for further observations with prolonged period and improved accuracy in order to tighten the bound for $\epsilon$ using the S2 star orbit., Comment: 11 pages, 5 figures, 1 table; v2: published in JCAP
- Published
- 2024
- Full Text
- View/download PDF
194. Geometry of the fixed points loci and discretization of Springer fibers in classical types
- Author
-
Hoang, Do Kien
- Subjects
Mathematics - Representation Theory ,Mathematics - Algebraic Geometry - Abstract
Consider a simple algebraic group $G$ of classical type and its Lie algebra $\mathfrak{g}$. Let $(e,h,f) \subset \mathfrak{g}$ be an $\mathfrak{sl}_2$-triple and $Q_e= C_G(e,h,f)$. The torus $T_e$ that comes from the $\mathfrak{sl}_2$-triple acts on the Springer fiber $\mathcal{B}_e$. Let $\mathcal{B}_e^{gr}$ denote the fixed point loci of $\mathcal{B}_e$ under this torus action. Our main geometric result is that when the partition of $e$ has up to $4$ rows, the derived category $D^b(\mathcal{B}_e^{gr})$ admits a complete exceptional collection that is compatible with the $Q_e$-action. The objects in this collection give us a finite set $Y_e$ that is naturally equipped with a $Q_e$-centrally extended structure. We prove that the set $Y_e$ constructed in this way coincides with a finite set that has appeared in various contexts in representation theory. For example, a direct summand $J_c$ of the asymptotic Hecke algebra is isomorphic to $K_0(Sh^{Q_e}(Y_e\times Y_e)$. The left cells in the two-sided cell $c$ corresponding to the adjoint orbit of $e$ are in bijection with the $Q_e$-orbits in $Y_e$. Our main numerical result is an algorithm to compute the multiplicities of the $Q_e$-centrally extended orbits that appear in $Y_e$., Comment: Any comments are welcome!
- Published
- 2024
195. On Detecting Low-pass Graph Signals under Partial Observations
- Author
-
Nguyen, Hoang-Son and Wai, Hoi-To
- Subjects
Electrical Engineering and Systems Science - Signal Processing - Abstract
The application of graph signal processing (GSP) on partially observed graph signals with missing nodes has gained attention recently. This is because processing data from large graphs are difficult, if not impossible due to the lack of availability of full observations. Many prior works have been developed using the assumption that the generated graph signals are smooth or low pass filtered. This paper treats a blind graph filter detection problem under this context. We propose a detector that certifies whether the partially observed graph signals are low pass filtered, without requiring the graph topology knowledge. As an example application, our detector leads to a pre-screening method to filter out non low pass signals and thus robustify the prior GSP algorithms. We also bound the sample complexity of our detector in terms of the class of filters, number of observed nodes, etc. Numerical experiments verify the efficacy of our method., Comment: 7 pages, 3 figures
- Published
- 2024
196. Effect of helium bubbles on the mobility of edge dislocations in copper
- Author
-
Hoang, Minh Tam, Mathew, Nithin, Blaschke, Daniel N., and Fensin, Saryu
- Subjects
Condensed Matter - Materials Science - Abstract
Helium bubbles can form in materials upon exposure to irradiation. It is well known that the presence of helium bubbles can cause changes in the mechanical behavior of materials. To improve the lifetime of nuclear components, it is important to understand deformation mechanisms in helium-containing materials. In this work, we investigate the interactions between edge dislocations and helium bubbles in copper using molecular dynamics (MD) simulations. We focus on the effect of helium bubble pressure (equivalently, the helium-to-vacancy ratio) on the obstacle strength of helium bubbles and their interaction with dislocations. Our simulations predict significant differences in the interaction mechanisms as a function of helium bubble pressure. Specifically, bubbles with high internal pressure are found to exhibit weaker obstacle strength as compared to low-pressure bubbles of the same size due to the formation of super-jogs in the dislocation. Activation energies and rate constants extracted from the MD data confirm this transition in mechanism and enable upscaling of these phenomena to higher length-scale models., Comment: 9 pages, 10 figures; v2+v3 minor revision
- Published
- 2024
- Full Text
- View/download PDF
197. Gradient Boosting Mapping for Dimensionality Reduction and Feature Extraction
- Author
-
Patron, Anri, Prasad, Ayush, Luu, Hoang Phuc Hau, and Puolamäki, Kai
- Subjects
Computer Science - Machine Learning - Abstract
A fundamental problem in supervised learning is to find a good set of features or distance measures. If the new set of features is of lower dimensionality and can be obtained by a simple transformation of the original data, they can make the model understandable, reduce overfitting, and even help to detect distribution drift. We propose a supervised dimensionality reduction method Gradient Boosting Mapping (GBMAP), where the outputs of weak learners -- defined as one-layer perceptrons -- define the embedding. We show that the embedding coordinates provide better features for the supervised learning task, making simple linear models competitive with the state-of-the-art regressors and classifiers. We also use the embedding to find a principled distance measure between points. The features and distance measures automatically ignore directions irrelevant to the supervised learning task. We also show that we can reliably detect out-of-distribution data points with potentially large regression or classification errors. GBMAP is fast and works in seconds for dataset of million data points or hundreds of features. As a bonus, GBMAP provides a regression and classification performance comparable to the state-of-the-art supervised learning methods., Comment: 32 pages, 8 figures, 5 tables
- Published
- 2024
198. UCCIX: Irish-eXcellence Large Language Model
- Author
-
Tran, Khanh-Tung, O'Sullivan, Barry, and Nguyen, Hoang D.
- Subjects
Computer Science - Computation and Language ,Computer Science - Artificial Intelligence - Abstract
The development of Large Language Models (LLMs) has predominantly focused on high-resource languages, leaving extremely low-resource languages like Irish with limited representation. This work presents UCCIX, a pioneering effort on the development of an open-source Irish-based LLM. We propose a novel framework for continued pre-training of LLMs specifically adapted for extremely low-resource languages, requiring only a fraction of the textual data typically needed for training LLMs according to scaling laws. Our model, based on Llama 2-13B, outperforms much larger models on Irish language tasks with up to 12% performance improvement, showcasing the effectiveness and efficiency of our approach. We also contribute comprehensive Irish benchmarking datasets, including IrishQA, a question-answering dataset, and Irish version of MT-bench. These datasets enable rigorous evaluation and facilitate future research in Irish LLM systems. Our work aims to preserve and promote the Irish language, knowledge, and culture of Ireland in the digital era while providing a framework for adapting LLMs to other indigenous languages.
- Published
- 2024
199. On Local Mutual-Information Privacy
- Author
-
Ngo, Khac-Hoang, Östman, Johan, and Amat, Alexandre Graell i
- Subjects
Computer Science - Information Theory - Abstract
Local mutual-information privacy (LMIP) is a privacy notion that aims to quantify the reduction of uncertainty about the input data when the output of a privacy-preserving mechanism is revealed. We study the relation of LMIP with local differential privacy (LDP), the de facto standard notion of privacy in context-independent (CI) scenarios, and with local information privacy (LIP), the state-of-the-art notion for context-dependent settings. We establish explicit conversion rules, i.e., bounds on the privacy parameters for an LMIP mechanism to also satisfy LDP/LIP, and vice versa. We use our bounds to formally verify that LMIP is a weak privacy notion. We also show that uncorrelated Gaussian noise is the best-case noise in terms of CI-LMIP if both the input data and the noise are subject to an average power constraint., Comment: IEEE Information Theory Workshop (ITW) 2024
- Published
- 2024
200. Repairing Reed-Solomon Codes with Side Information
- Author
-
Dinh, Thi Xinh, Le, Ba Thong, Dau, Son Hoang, Boztas, Serdar, Kruglik, Stanislav, Kiah, Han Mao, Viterbo, Emanuele, Etzion, Tuvi, and Chee, Yeow Meng
- Subjects
Computer Science - Information Theory ,94B05, 94B60 ,E.4 - Abstract
We generalize the problem of recovering a lost/erased symbol in a Reed-Solomon code to the scenario in which some side information about the lost symbol is known. The side information is represented as a set $S$ of linearly independent combinations of the sub-symbols of the lost symbol. When $S = \varnothing$, this reduces to the standard problem of repairing a single codeword symbol. When $S$ is a set of sub-symbols of the erased one, this becomes the repair problem with partially lost/erased symbol. We first establish that the minimum repair bandwidth depends on $|S|$ and not the content of $S$ and construct a lower bound on the repair bandwidth of a linear repair scheme with side information $S$. We then consider the well-known subspace-polynomial repair schemes and show that their repair bandwidths can be optimized by choosing the right subspaces. Finally, we demonstrate several parameter regimes where the optimal bandwidths can be achieved for full-length Reed-Solomon codes.
- Published
- 2024
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.