arXiv subjects

Haoyang Liu

Publications and source records attributed to Haoyang Liu.

At least 73 records · Page 4Linked to original sources

arXiv2024

Exploration of Halo Substructures in IoM Space with \textit{Gaia} DR3

Using kinematic data from the Gaia Data Release 3 catalog, along with metallicity estimates robustly derived from Gaia XP spectra, we have explored the Galactic stellar halo in search of both known and potentially new substructures. By applying the HDBSCAN clustering algorithm in IoM space (i.e. $E,L_{z}$ and $L_{\perp}$$ = \sqrt{L_{x}^2+L_{y}^2}$), we identified 5 previously known substructures: Gaia-Sausage-Enceladus (GSE), Helmi Streams, I'itoi + Sequoia and Hot Thick Disc. We additionally found NGC 3201 and NGC 5139 in this work, and NGC 3201 shares similar distributions in phase space and metallicties to Arjuna, which possibly implies that they have the same origin. Three newly discovered substructures are Prograde Substructure 1 (PG1), Prograde Substructure 2 (PG2) and the Low Energy Group. PG1, with a higher $V_ϕ$ than typical GSE member stars, is considered as either a low eccentricity and metal-rich part of GSE or part of the metal-poor disc. PG2, sharing kinematic similarities with Aleph, is thought to be its relatively highly eccentric component or the mixture of Aleph and disc. The Low Energy Group, whose metal-poor component of metallicity distribution function has a mean value [M/H] $\sim$ $-$1.29 (compared to that of Heracles [M/H] $\sim$ $-$1.26), may have associations with Heracles.

astro-ph.GA↗

arXiv2024

Robust and improved constraints on higher-curvature gravitational effective-field-theory with the GW170608 event

Effective field theory methods allow us to modify general relativity through higher-curvature corrections to the Einstein-Hilbert action, while preserving Lorentz invariance and the number of gravitational degrees of freedom. We here construct an approximate inspiral-merger-ringdown waveform model within the cubic, parity-preserving class of effective-field-theory extensions to Einstein's theory for the gravitational waves emitted by quasi-circular binary black holes with aligned/anti-aligned spins. Using this waveform model, we first explore the detectability of non-Einsteinian effective-field-theory effects through an extended version of effective cycles to illustrate the need to include non-Einsteinian amplitude corrections. We then use this model to analyze the GW170608 event in a full Bayesian framework, and we place new improved and more robust constraints on the coupling constants of the effective field theory. Our Bayesian model selection study disfavors the non-Einsteinian theory with a (log) Bayes factor of $\log \mathcal{B}^{\text{EFT}}_{\text{GR}} = -2.81$. Our Bayesian parameter estimation study places the constraints $\barα_1=0.87^{+1.95}_{-1.03}$ and $ \barα_2=-0.35^{+4.12}_{-2.92}$ at $90\%$ confidence on the coupling parameters of the effective-field theory. These constraints are $3.5$ stronger than previous constraints, informative relative to the prior, and independent of the choice of prior on the coupling parameters of the modified theory.

gr-qc↗

arXiv2024

Emotion Detection through Body Gesture and Face

The project leverages advanced machine and deep learning techniques to address the challenge of emotion recognition by focusing on non-facial cues, specifically hands, body gestures, and gestures. Traditional emotion recognition systems mainly rely on facial expression analysis and often ignore the rich emotional information conveyed through body language. To bridge this gap, this method leverages the Aff-Wild2 and DFEW databases to train and evaluate a model capable of recognizing seven basic emotions (angry, disgust, fear, happiness, sadness, surprise, and neutral) and estimating valence and continuous scales wakeup descriptor. Leverage OpenPose for pose estimation to extract detailed body posture and posture features from images and videos. These features serve as input to state-of-the-art neural network architectures, including ResNet, and ANN for emotion classification, and fully connected layers for valence arousal regression analysis. This bifurcation strategy can solve classification and regression problems in the field of emotion recognition. The project aims to contribute to the field of affective computing by enhancing the ability of machines to interpret and respond to human emotions in a more comprehensive and nuanced way. By integrating multimodal data and cutting-edge computational models, I aspire to develop a system that not only enriches human-computer interaction but also has potential applications in areas as diverse as mental health support, educational technology, and autonomous vehicle systems.

cs.CV↗

arXiv2024

Deep Symbolic Optimization for Combinatorial Optimization: Accelerating Node Selection by Discovering Potential Heuristics

Combinatorial optimization (CO) is one of the most fundamental mathematical models in real-world applications. Traditional CO solvers, such as Branch-and-Bound (B&B) solvers, heavily rely on expert-designed heuristics, which are reliable but require substantial manual tuning. Recent studies have leveraged deep learning (DL) models as an alternative to capture rich feature patterns for improved performance on GPU machines. Nonetheless, the drawbacks of high training and inference costs, as well as limited interpretability, severely hinder the adoption of DL methods in real-world applications. To address these challenges, we propose a novel deep symbolic optimization learning framework that combines their advantages. Specifically, we focus on the node selection module within B&B solvers -- namely, deep symbolic optimization for node selection (Dso4NS). With data-driven approaches, Dso4NS guides the search for mathematical expressions within the high-dimensional discrete symbolic space and then incorporates the highest-performing mathematical expressions into a solver. The data-driven model captures the rich feature information in the input data and generates symbolic expressions, while the expressions deployed in solvers enable fast inference with high interpretability. Experiments demonstrate the effectiveness of Dso4NS in learning high-quality expressions, outperforming existing approaches on a CPU machine. Encouragingly, the learned CPU-based policies consistently achieve performance comparable to state-of-the-art GPU-based approaches.

cs.LG↗

arXiv2024

Foundation Model-oriented Robustness: Robust Image Model Evaluation with Pretrained Models

Machine learning has demonstrated remarkable performance over finite datasets, yet whether the scores over the fixed benchmarks can sufficiently indicate the model's performance in the real world is still in discussion. In reality, an ideal robust model will probably behave similarly to the oracle (e.g., the human users), thus a good evaluation protocol is probably to evaluate the models' behaviors in comparison to the oracle. In this paper, we introduce a new robustness measurement that directly measures the image classification model's performance compared with a surrogate oracle (i.e., a foundation model). Besides, we design a simple method that can accomplish the evaluation beyond the scope of the benchmarks. Our method extends the image datasets with new samples that are sufficiently perturbed to be distinct from the ones in the original sets, but are still bounded within the same image-label structure the original test image represents, constrained by a foundation model pretrained with a large amount of samples. As a result, our new method will offer us a new way to evaluate the models' robustness performance, free of limitations of fixed benchmarks or constrained perturbations, although scoped by the power of the oracle. In addition to the evaluation results, we also leverage our generated data to understand the behaviors of the model and our new evaluation strategies.

cs.CV↗

arXiv2024

Accelerating PDE Data Generation via Differential Operator Action in Solution Space

Recent advancements in data-driven approaches, such as Neural Operator (NO), have demonstrated their effectiveness in reducing the solving time of Partial Differential Equations (PDEs). However, one major challenge faced by these approaches is the requirement for a large amount of high-precision training data, which needs significant computational costs during the generation process. To address this challenge, we propose a novel PDE dataset generation algorithm, namely Differential Operator Action in Solution space (DiffOAS), which speeds up the data generation process and enhances the precision of the generated data simultaneously. Specifically, DiffOAS obtains a few basic PDE solutions and then combines them to get solutions. It applies differential operators on these solutions, a process we call 'operator action', to efficiently generate precise PDE data points. Theoretical analysis shows that the time complexity of DiffOAS method is one order lower than the existing generation method. Experimental results show that DiffOAS accelerates the generation of large-scale datasets with 10,000 instances by 300 times. Even with just 5% of the generation time, NO trained on the data generated by DiffOAS exhibits comparable performance to that using the existing generation method, which highlights the efficiency of DiffOAS.

cs.LG↗

arXiv2024

Chirality-Induced Magnet-Free Spin Generation in a Semiconductor

Electrical generation and transduction of polarized electron spins in semiconductors are of central interest in spintronics and quantum information science. While spin generation in semiconductors has been frequently realized via electrical injection from a ferromagnet, there are significant advantages in nonmagnetic pathways of creating spin polarization. One such pathway exploits the interplay of electron spin with chirality in electronic structures or real space. Here, utilizing chirality-induced spin selectivity (CISS), we demonstrate efficient creation of spin accumulation in n-doped GaAs via electric current injection from a normal metal (Au) electrode through a self-assembled monolayer of chiral molecules (α-helix L-polyalanine, AHPA-L). The resulting spin polarization is detected as a Hanle effect in the n-GaAs, which is found to obey a distinct universal scaling with temperature and bias current consistent with chirality-induced spin accumulation. The experiment constitutes a definitive observation of CISS in a fully nonmagnetic device structure and demonstration of its ability to generate spin accumulation in a conventional semiconductor. The results thus place key constraints on the physical mechanism of CISS and present a new scheme for magnet-free semiconductor spintronics.

cond-mat.mes-hall↗

arXiv2024

Machine Learning Insides OptVerse AI Solver: Design Principles and Applications

In an era of digital ubiquity, efficient resource management and decision-making are paramount across numerous industries. To this end, we present a comprehensive study on the integration of machine learning (ML) techniques into Huawei Cloud's OptVerse AI Solver, which aims to mitigate the scarcity of real-world mathematical programming instances, and to surpass the capabilities of traditional optimization techniques. We showcase our methods for generating complex SAT and MILP instances utilizing generative models that mirror multifaceted structures of real-world problem. Furthermore, we introduce a training framework leveraging augmentation policies to maintain solvers' utility in dynamic environments. Besides the data generation and augmentation, our proposed approaches also include novel ML-driven policies for personalized solver strategies, with an emphasis on applications like graph convolutional networks for initial basis selection and reinforcement learning for advanced presolving and cut selection. Additionally, we detail the incorporation of state-of-the-art parameter tuning algorithms which markedly elevate solver performance. Compared with traditional solvers such as Cplex and SCIP, our ML-augmented OptVerse AI Solver demonstrates superior speed and precision across both established benchmarks and real-world scenarios, reinforcing the practical imperative and effectiveness of machine learning techniques in mathematical programming solvers.

cs.AI↗

arXiv2023

Beyond Pixels: Exploring Human-Readable SVG Generation for Simple Images with Vision Language Models

In the field of computer graphics, the use of vector graphics, particularly Scalable Vector Graphics (SVG), represents a notable development from traditional pixel-based imagery. SVGs, with their XML-based format, are distinct in their ability to directly and explicitly represent visual elements such as shape, color, and path. This direct representation facilitates a more accurate and logical depiction of graphical elements, enhancing reasoning and interpretability. Recognizing the potential of SVGs, the machine learning community has introduced multiple methods for image vectorization. However, transforming images into SVG format while retaining the relational properties and context of the original scene remains a key challenge. Most vectorization methods often yield SVGs that are overly complex and not easily interpretable. In response to this challenge, we introduce our method, Simple-SVG-Generation (S\textsuperscript{2}VG\textsuperscript{2}). Our method focuses on producing SVGs that are both accurate and simple, aligning with human readability and understanding. With simple images, we evaluate our method with reasoning tasks together with advanced language models, the results show a clear improvement over previous SVG generation methods. We also conducted surveys for human evaluation on the readability of our generated SVGs, the results also favor our methods.

cs.CV↗

arXiv2023

QUIZ: An Arbitrary Volumetric Point Matching Method for Medical Image Registration

Rigid pre-registration involving local-global matching or other large deformation scenarios is crucial. Current popular methods rely on unsupervised learning based on grayscale similarity, but under circumstances where different poses lead to varying tissue structures, or where image quality is poor, these methods tend to exhibit instability and inaccuracies. In this study, we propose a novel method for medical image registration based on arbitrary voxel point of interest matching, called query point quizzer (QUIZ). QUIZ focuses on the correspondence between local-global matching points, specifically employing CNN for feature extraction and utilizing the Transformer architecture for global point matching queries, followed by applying average displacement for local image rigid transformation. We have validated this approach on a large deformation dataset of cervical cancer patients, with results indicating substantially smaller deviations compared to state-of-the-art methods. Remarkably, even for cross-modality subjects, it achieves results surpassing the current state-of-the-art.

cs.CV↗

arXiv2023

Towards Trustworthy and Aligned Machine Learning: A Data-centric Survey with Causality Perspectives

The trustworthiness of machine learning has emerged as a critical topic in the field, encompassing various applications and research areas such as robustness, security, interpretability, and fairness. The last decade saw the development of numerous methods addressing these challenges. In this survey, we systematically review these advancements from a data-centric perspective, highlighting the shortcomings of traditional empirical risk minimization (ERM) training in handling challenges posed by the data. Interestingly, we observe a convergence of these methods, despite being developed independently across trustworthy machine learning subfields. Pearl's hierarchy of causality offers a unifying framework for these techniques. Accordingly, this survey presents the background of trustworthy machine learning development using a unified set of concepts, connects this language to Pearl's causal hierarchy, and finally discusses methods explicitly inspired by causality literature. We provide a unified language with mathematical vocabulary to link these methods across robustness, adversarial robustness, interpretability, and fairness, fostering a more cohesive understanding of the field. Further, we explore the trustworthiness of large pretrained models. After summarizing dominant techniques like fine-tuning, parameter-efficient fine-tuning, prompting, and reinforcement learning with human feedback, we draw connections between them and the standard ERM. This connection allows us to build upon the principled understanding of trustworthy methods, extending it to these new techniques in large pretrained models, paving the way for future methods. Existing methods under this perspective are also reviewed. Lastly, we offer a brief summary of the applications of these methods and discuss potential future aspects related to our survey. For more information, please visit http://trustai.one.

cs.LG↗

arXiv2023

A Decomposition Augmented Lagrangian Method for Low-rank Semidefinite Programming

We develop a decomposition method based on the augmented Lagrangian framework to solve a broad family of semidefinite programming problems, possibly with nonlinear objective functions, nonsmooth regularization, and general linear equality/inequality constraints. In particular, the positive semidefinite variable along with a group of linear constraints can be transformed into a variable on a smooth manifold via matrix factorization. The nonsmooth regularization and other general linear constraints are handled by the augmented Lagrangian method. Therefore, each subproblem can be solved by a semismooth Newton method on a manifold. Theoretically, we show that the first and second-order necessary optimality conditions for the factorized subproblem are also sufficient for the original subproblem under certain conditions. Convergence analysis is established for the Riemannian subproblem and the augmented Lagrangian method. Extensive numerical experiments on large-scale semidefinite programming problems such as max-cut, nearest correlation estimation, clustering, and sparse principal component analysis demonstrate the strength of our proposed method compared to other state-of-the-art methods.

math.OC↗

arXiv2022

Interplay of Structural Chirality, Electron Spin and Topological Orbital in Chiral Molecular Spin Valves

Chirality has been a property of central importance in chemistry and biology for more than a century, and is now taking on increasing relevance in condensed matter physics. Recently, electrons were found to become spin polarized after transmitting through chiral molecules, crystals, and their hybrids. This phenomenon, called chirality-induced spin selectivity (CISS), presents broad application potentials and far-reaching fundamental implications involving intricate interplays among structural chirality, topological states, and electronic spin and orbitals. However, the microscopic picture of how chiral geometry influences electronic spin remains elusive. In this work, via a direct comparison of magnetoconductance (MC) measurements on magnetic semiconductor-based chiral molecular spin valves with normal metal electrodes of contrasting strengths of spin-orbit coupling (SOC), we unambiguously identified the origin of the SOC, a necessity for the CISS effect, given the negligible SOC in organic molecules. The experiments revealed that a heavy-metal electrode provides SOC to convert the orbital polarization induced by the chiral molecular structure to spin polarization. Our results evidence the essential role of SOC in the metal electrode for engendering the CISS spin valve effect. A tunneling model with a magnetochiral modulation of the potential barrier is shown to quantitatively account for the unusual transport behavior. This work hence produces critical new insights on the microscopic mechanism of CISS, and more broadly, reveals a fundamental relation between structure chirality, electron spin, and orbital.

cond-mat.mtrl-sci↗

arXiv2022

Augmented Lagrangian Methods for Time-varying Constrained Online Convex Optimization

In this paper, we consider online convex optimization (OCO) with time-varying loss and constraint functions. Specifically, the decision maker chooses sequential decisions based only on past information, meantime the loss and constraint functions are revealed over time. We first develop a class of model-based augmented Lagrangian methods (MALM) for time-varying functional constrained OCO (without feedback delay). Under standard assumptions, we establish sublinear regret and sublinear constraint violation of MALM. Furthermore, we extend MALM to deal with time-varying functional constrained OCO with delayed feedback, in which the feedback information of loss and constraint functions is revealed to decision maker with delays. Without additional assumptions, we also establish sublinear regret and sublinear constraint violation for the delayed version of MALM. Finally, numerical results for several examples of constrained OCO including online network resource allocation, online logistic regression and online quadratically constrained quadratical program are presented to demonstrate the efficiency of the proposed algorithms.

math.OC↗

arXiv2022

Regrets of Proximal Method of Multipliers for Online Non-convex Optimization with Long Term Constraints

The online optimization problem with non-convex loss functions over a closed convex set, coupled with a set of inequality (possibly non-convex) constraints is a challenging online learning problem. A proximal method of multipliers with quadratic approximations (named as OPMM) is presented to solve this online non-convex optimization with long term constraints. Regrets of the violation of Karush-Kuhn-Tucker conditions of OPMM for solving online non-convex optimization problems are analyzed. Under mild conditions, it is shown that this algorithm exhibits ${\cO}(T^{-1/8})$ Lagrangian gradient violation regret, ${\cO}(T^{-1/8})$ constraint violation regret and ${\cO}(T^{-1/4})$ complementarity residual regret if parameters in the algorithm are properly chosen, where $T$ denotes the number of time periods. For the case that the objective is a convex quadratic function, we demonstrate that the regret of the objective reduction can be established even the feasible set is non-convex. For the case when the constraint functions are convex, if the solution of the subproblem in OPMM is obtained by solving its dual, OPMM is proved to be an implementable projection method for solving the online non-convex optimization problem.

math.OC↗

arXiv2021

The design of quaternary eutectic solder by machine learning

In this paper, we obtain a Sn-Bi-In-Pb quaternary near eutectic alloy composition from machine learning model. The eutectic points and the alloy composition were evaluated and continuously improved by experimental input. The actual composition is near the result given by machine learning. We conclude that the application of machine learning in solder design has shown the potential to overcome the challenge in searching for the next generation eutectic solders, which will have a broad impact on the industry.

physics.app-ph↗

arXiv2021

UIUC_BioNLP at SemEval-2021 Task 11: A Cascade of Neural Models for Structuring Scholarly NLP Contributions

We propose a cascade of neural models that performs sentence classification, phrase recognition, and triple extraction to automatically structure the scholarly contributions of NLP publications. To identify the most important contribution sentences in a paper, we used a BERT-based classifier with positional features (Subtask 1). A BERT-CRF model was used to recognize and characterize relevant phrases in contribution sentences (Subtask 2). We categorized the triples into several types based on whether and how their elements were expressed in text, and addressed each type using separate BERT-based classifiers as well as rules (Subtask 3). Our system was officially ranked second in Phase 1 evaluation and first in both parts of Phase 2 evaluation. After fixing a submission error in Pharse 1, our approach yields the best results overall. In this paper, in addition to a system description, we also provide further analysis of our results, highlighting its strengths and limitations. We make our code publicly available at https://github.com/Liu-Hy/nlp-contrib-graph.

cs.CL↗

arXiv2021

Scaling behavior of density gradient accelerated mixing rate in shock bubble interaction

Variable-density mixing in shock bubble interaction, a canonical flow of Richtermyer-Meshkov instability, is studied by the high-resolution simulation. While the dissipation mainly controls the passive scalar mixing rate, an objective definition of variable-density mixing rate characterizing the macroscopic mixing formation is still lacking, and the fundamental behavior of mixing rate evolution is not yet well understood. Here, we first show that the variable-density mixing of shock bubble interaction is distinctly different from the previous observations in the passive scalar mixing. The widely-accepted hyperbolic conservation of the first moment of concentration in the scalar mixing, i.e., the conservation of the mean concentration, is violated in variable-density flows. We further combine the compositional transport equation and the divergence relation for the miscible flows to provide the evidence that the existence of density gradient accelerated mixing rate, decomposed by the accelerated dissipation term and redistributed diffusion term, contributes to the anomalous decrease or increase of the mean concentration depending on Atwood number. Further analyzing a number of simulations for the cylindrical or spherical bubbles under a broad range of shock Mach numbers, Reynolds numbers, and Peclet numbers, the density gradient accelerated mixing rate exhibits weak dependent on Peclet numbers, and identifies an Atwood number range with high mixing rate, which can be theoretically predicted based on the mode of hyperbolic conservation violation behavior.

physics.flu-dyn↗