Searcharxiv⌕ Search

arXiv subjects

Xin Huang

Publications and source records attributed to Xin Huang.

At least 181 records · Page 10Linked to original sources

Recycling of Perovskite Substrate

The use of water-soluble sacrificial layer of Sr$_3$Al$_2$O$_6$ has tremendously boosted the research on freestanding functional oxide thin films, especially thanks to its ultimate capability to produce high-quality epitaxial perovskite thin films. However, the costly single-crystalline substrates, e.g. SrTiO$_3$, were generally discarded after obtaining the freestanding thin films. Here, we demonstrate that the SrTiO$_3$ substrates can be recycled to fabricate La$_{0.7}$Sr$_{0.3}$MnO$_3$ films with nearly identical structural and electrical properties. After attaining freestanding thin films, the residues on SrTiO$_3$ can be removed by 80 \degree C hot water soaking and rinsing treatments. Consequently, the surface of SrTiO$_3$ reverted to its original step-and-terrace structure.

physics.app-ph↗

Descent of splendid Rickard equivalences in alternating groups

We show that each block of an alternating group over an arbitrary complete discrete valuation ring is splendidly Rickard equivalent to its Brauer correspondent. This provides new evidence for a refined version of Broué's abelian defect group conjecture proposed by Kessar and Linckelmann.

math.RT↗

On picking sequences for chores

We consider the problem of allocating $m$ indivisible chores to $n$ agents with additive disvaluation (cost) functions. It is easy to show that there are picking sequences that give every agent (that uses the greedy picking strategy) a bundle of chores of disvalue at most twice her share value (maximin share, MMS, for agents of equal entitlement, and anyprice share, APS, for agents of arbitrary entitlement). Aziz, Li and Wu (2022) designed picking sequences that improve this ratio to $\frac{5}{3}$ for the case of equal entitlement. We design picking sequences that improve the ratio to~1.733 for the case of arbitrary entitlement, and to $\frac{8}{5}$ for the case of equal entitlement. (In fact, computer assisted analysis suggests that the ratio is smaller than $1.543$ in the equal entitlement case.) We also prove a lower bound of $\frac{3}{2}$ on the obtainable ratio when $n$ is sufficiently large. Additional contributions of our work include improved guarantees in the equal entitlement case when $n$ is small; introduction of the chore share as a convenient proxy to other share notions for chores; introduction of ex-ante notions of envy for risk averse agents; enhancements to our picking sequences that eliminate such envy; showing that a known allocation algorithm (not based on picking sequences) for the equal entitlement case gives each agent a bundle of disvalue at most $\frac{4n-1}{3n}$ times her APS (previously, this ratio was shown for this algorithm with respect to the easier benchmark of the MMS).

cs.GT↗

Privileged Prior Information Distillation for Image Matting

Performance of trimap-free image matting methods is limited when trying to decouple the deterministic and undetermined regions, especially in the scenes where foregrounds are semantically ambiguous, chromaless, or high transmittance. In this paper, we propose a novel framework named Privileged Prior Information Distillation for Image Matting (PPID-IM) that can effectively transfer privileged prior environment-aware information to improve the performance of students in solving hard foregrounds. The prior information of trimap regulates only the teacher model during the training stage, while not being fed into the student network during actual inference. In order to achieve effective privileged cross-modality (i.e. trimap and RGB) information distillation, we introduce a Cross-Level Semantic Distillation (CLSD) module that reinforces the trimap-free students with more knowledgeable semantic representations and environment-aware information. We also propose an Attention-Guided Local Distillation module that efficiently transfers privileged local attributes from the trimap-based teacher to trimap-free students for the guidance of local-region optimization. Extensive experiments demonstrate the effectiveness and superiority of our PPID framework on the task of image matting. In addition, our trimap-free IndexNet-PPID surpasses the other competing state-of-the-art methods by a large margin, especially in scenarios with chromaless, weak texture, or irregular objects.

cs.CV↗

Envy-Free Cake Cutting with Graph Constraints

We study the classic problem of fairly dividing a heterogeneous and divisible resource -- represented by a cake, $[0,1]$ -- among $n$ agents. This work considers an interesting variant of the problem where agents are embedded on a graph. The graphical constraint entails that each agent evaluates her allocated share only against her neighbor's share. Given a graph, the goal is to efficiently find a locally envy-free allocation where every agent values her share to be at least as much as any of her neighbor's share. The best known algorithm (by Aziz and Mackenzie) for finding envy-free cake divisions has a hyper-exponential query complexity. One of the key technical contributions of this work is to identify a non-trivial graph structure -- tree graphs with depth at-most two (Depth2Tree) -- on $n$ agents that admits a query efficient cake-cutting protocol (under the Robertson-Webb query model). In particular, we develop a discrete protocol that finds a locally envy-free allocation among $n$ agents on depth-two trees with at-most $O(n^3 \log(n))$ cuts on the cake. For the special case of Depth2Tree where every non-root agent is connected to at-most two agents (2-Star), we show that $O(n^2)$ queries suffice. We complement our algorithmic results with establishing a lower bound of $Ω(n^2)$ (evaluation) queries for finding a locally envy-free allocation among $n$ agents on a 1-Star graph (under the assumption that the root agent partitions the cake into $n$ connected pieces).

cs.GT↗

Characterizing the Efficiency of Graph Neural Network Frameworks with a Magnifying Glass

Graph neural networks (GNNs) have received great attention due to their success in various graph-related learning tasks. Several GNN frameworks have then been developed for fast and easy implementation of GNN models. Despite their popularity, they are not well documented, and their implementations and system performance have not been well understood. In particular, unlike the traditional GNNs that are trained based on the entire graph in a full-batch manner, recent GNNs have been developed with different graph sampling techniques for mini-batch training of GNNs on large graphs. While they improve the scalability, their training times still depend on the implementations in the frameworks as sampling and its associated operations can introduce non-negligible overhead and computational cost. In addition, it is unknown how much the frameworks are 'eco-friendly' from a green computing perspective. In this paper, we provide an in-depth study of two mainstream GNN frameworks along with three state-of-the-art GNNs to analyze their performance in terms of runtime and power/energy consumption. We conduct extensive benchmark experiments at several different levels and present detailed analysis results and observations, which could be helpful for further improvement and optimization.

cs.LG↗

A Discrete and Bounded Locally Envy-Free Cake Cutting Protocol on Trees

We study the classic problem of \emph{fairly} dividing a heterogeneous and divisible resource -- modeled as a line segment $[0,1]$ and typically called as a \emph{cake} -- among $n$ agents. This work considers an interesting variant of the problem where agents are embedded on a graph. The graphical constraint entails that each agent evaluates her allocated share only against her neighbors' share. Given a graph, the goal is to efficiently find a \emph{locally envy-free} allocation where every agent values her share of the cake to be at least as much as that of any of her neighbors' share. The most significant contribution of this work is a bounded protocol that finds a locally envy-free allocation among $n$ agents on a tree graph using $n^{O(n)}$ queries under the standard Robertson-Webb (RW) query model. The query complexity of our proposed protocol, though exponential, significantly improves the currently best known hyper-exponential query complexity bound of Aziz and Mackenzie [AM16] for complete graphs. In particular, we also show that if the underlying tree graph has a depth of at most two, one can find a locally envy-free allocation with $O(n^4 \log n)$ RW queries. This is the first and the only known locally envy-free cake cutting protocol with polynomial query complexity for a non-trivial graph structure. Interestingly, our discrete protocols are simple and easy to understand, as opposed to highly involved protocol of [AM16]. This simplicity can be attributed to their recursive nature and the use of a single agent as a designated \emph{cutter}. We believe that these results will help us improve our algorithmic understanding of the arguably challenging problem of envy-free cake-cutting by uncovering the bottlenecks in its query complexity and its relation to the underlying graph structures.

cs.GT↗

P4P: Conflict-Aware Motion Prediction for Planning in Autonomous Driving

Motion prediction is crucial in enabling safe motion planning for autonomous vehicles in interactive scenarios. It allows the planner to identify potential conflicts with other traffic agents and generate safe plans. Existing motion predictors often focus on reducing prediction errors, yet it remains an open question on how well they help identify the conflicts for the planner. In this paper, we evaluate state-of-the-art predictors through novel conflict-related metrics, such as the success rate of identifying conflicts. Surprisingly, the predictors suffer from a low success rate and thus lead to a large percentage of collisions when we test the prediction-planning system in an interactive simulator. To fill the gap, we propose a simple but effective alternative that combines a physics-based trajectory generator and a learning-based relation predictor to identify conflicts and infer conflict relations. We demonstrate that our predictor, P4P, achieves superior performance over existing learning-based predictors in realistic interactive driving scenarios from Waymo Open Motion Dataset.

cs.RO↗

InterSim: Interactive Traffic Simulation via Explicit Relation Modeling

Interactive traffic simulation is crucial to autonomous driving systems by enabling testing for planners in a more scalable and safe way compared to real-world road testing. Existing approaches learn an agent model from large-scale driving data to simulate realistic traffic scenarios, yet it remains an open question to produce consistent and diverse multi-agent interactive behaviors in crowded scenes. In this work, we present InterSim, an interactive traffic simulator for testing autonomous driving planners. Given a test plan trajectory from the ego agent, InterSim reasons about the interaction relations between the agents in the scene and generates realistic trajectories for each environment agent that are consistent with the relations. We train and validate our model on a large-scale interactive driving dataset. Experiment results show that InterSim achieves better simulation realism and reactivity in two simulation tasks compared to a state-of-the-art learning-based traffic simulator.

cs.RO↗

Effects of the momentum dependence of nuclear symmetry potential on pion observables in Sn + Sn collisions at 270 MeV/nucleon

Within a transport model, we study effects of the momentum dependence of nuclear symmetry potential on pion observables in central Sn + Sn collisions at 270 MeV/nucleon. To this end, a quantity $U_{sym}^{\infty}(ρ_{0})$, i.e., the value of nuclear symmetry potential at the saturation density $ρ_{0}$ and infinitely large nucleon momentum, is used to characterise the momentum dependence of nuclear symmetry potential. It is shown that with a certain $L$ (i.e., slope of nuclear symmetry energy at $ρ_{0}$) the characteristic parameter $U_{sym}^{\infty}(ρ_{0})$ of symmetry potential affects significantly the production of $π^{-}$ and $π^{+}$ as well as their pion ratios. Moreover, through comparing the charged pion yields, pion ratios as well the spectral pion ratios of theoretical simulations for the reactions $^{108}$Sn + $^{112}$Sn and $^{132}$Sn + $^{124}$Sn with the corresponding data in S$π$RIT experiments, we find that our results favor a constraint on $U_{sym}^{\infty}(ρ_{0})$, i.e., $-160^{+18}_{-9}$~MeV, and the $L$ is also suggested within a range, i.e., $62.7<L<93.1$~MeV. In addition, it is shown that the pion observable of $^{197}$Au + $^{197}$Au collisions at 400~MeV/nucleon also supports the extracted value for $U_{sym}^{\infty}(ρ_{0})$.

nucl-th↗

Multi-Agent Chance-Constrained Stochastic Shortest Path with Application to Risk-Aware Intelligent Intersection

In transportation networks, where traffic lights have traditionally been used for vehicle coordination, intersections act as natural bottlenecks. A formidable challenge for existing automated intersections lies in detecting and reasoning about uncertainty from the operating environment and human-driven vehicles. In this paper, we propose a risk-aware intelligent intersection system for autonomous vehicles (AVs) as well as human-driven vehicles (HVs). We cast the problem as a novel class of Multi-agent Chance-Constrained Stochastic Shortest Path (MCC-SSP) problems and devise an exact Integer Linear Programming (ILP) formulation that is scalable in the number of agents' interaction points (e.g., potential collision points at the intersection). In particular, when the number of agents within an interaction point is small, which is often the case in intersections, the ILP has a polynomial number of variables and constraints. To further improve the running time performance, we show that the collision risk computation can be performed offline. Additionally, a trajectory optimization workflow is provided to generate risk-aware trajectories for any given intersection. The proposed framework is implemented in CARLA simulator and evaluated under a fully autonomous intersection with AVs only as well as in a hybrid setup with a signalized intersection for HVs and an intelligent scheme for AVs. As verified via simulations, the featured approach improves intersection's efficiency by up to $200\%$ while also conforming to the specified tunable risk threshold.

cs.AI↗

Coulomb-correlated states of moiré excitons and charges in a semiconductor moiré lattice

Semiconductor moiré heterostructures exhibit rich correlation-induced many-body phenomena with signatures of emergent magnetism, Mott insulating states or generalized Wigner crystals observed in optical spectroscopy by probing intralayer excitons. However, as the staggered band alignment in the underlying WSe$_2$/WS$_2$ heterobilayer system separates photoexcited electrons and holes to form lowest-energy interlayer excitons, direct access to interactions between correlated charge states and ground state moiré excitons remained elusive. Here, we use MoSe$_2$/WS$_2$ heterostacks with type-I band alignment to probe Coulomb interactions of elementary charges with the ground and excited states of moiré excitons. In addition to positive and negative moiré trions reminiscent of their canonical counterparts in monolayer MoSe$_2$, we reveal novel many-body states formed between moiré excitons and charges at fractional filling factors of the periodic moiré lattice. For both electrons and holes, these states exhibit doping-dependent Landé factors as a hallmark of correlation-induced magnetism, identifying the MoSe$_2$/WS$_2$ heterobilayer as a unique system for studies of correlated phenomena in ambipolar doping regimes.

cond-mat.mes-hall↗

Computing Welfare-Maximizing Fair Allocations of Indivisible Goods

We analyze the run-time complexity of computing allocations that are both fair and maximize the utilitarian social welfare, defined as the sum of agents' utilities. We focus on two tractable fairness concepts: envy-freeness up to one item (EF1) and proportionality up to one item (PROP1). We consider two computational problems: (1) Among the utilitarian-maximal allocations, decide whether there exists one that is also fair; (2) among the fair allocations, compute one that maximizes the utilitarian welfare. We show that both problems are strongly NP-hard when the number of agents is variable, and remain NP-hard for a fixed number of agents greater than two. For the special case of two agents, we find that problem (1) is polynomial-time solvable, while problem (2) remains NP-hard. Finally, with a fixed number of agents, we design pseudopolynomial-time algorithms for both problems. We extend our results to the stronger fairness notions envy-freeness up to any item (EFx) and proportionality up to any item (PROPx).

cs.GT↗

UniNet: Unified Architecture Search with Convolution, Transformer, and MLP

Recently, transformer and multi-layer perceptron (MLP) architectures have achieved impressive results on various vision tasks. However, how to effectively combine those operators to form high-performance hybrid visual architectures still remains a challenge. In this work, we study the learnable combination of convolution, transformer, and MLP by proposing a novel unified architecture search approach. Our approach contains two key designs to achieve the search for high-performance networks. First, we model the very different searchable operators in a unified form, and thus enable the operators to be characterized with the same set of configuration parameters. In this way, the overall search space size is significantly reduced, and the total search cost becomes affordable. Second, we propose context-aware downsampling modules (DSMs) to mitigate the gap between the different types of operators. Our proposed DSMs are able to better adapt features from different types of operators, which is important for identifying high-performance hybrid architectures. Finally, we integrate configurable operators and DSMs into a unified search space and search with a Reinforcement Learning-based search algorithm to fully explore the optimal combination of the operators. To this end, we search a baseline network and scale it up to obtain a family of models, named UniNets, which achieve much better accuracy and efficiency than previous ConvNets and Transformers. In particular, our UniNet-B5 achieves 84.9% top-1 accuracy on ImageNet, outperforming EfficientNet-B7 and BoTNet-T7 with 44% and 55% fewer FLOPs respectively. By pretraining on the ImageNet-21K, our UniNet-B6 achieves 87.4%, outperforming Swin-L with 51% fewer FLOPs and 41% fewer parameters. Code is available at https://github.com/Sense-X/UniNet.

cs.CV↗

Temporal coupled-mode theory for thermal emission from multiple arbitrarily coupled resonators

Controlling the spectral response of thermal emitters has become increasingly important for a range of energy and sensing applications. Conventional approaches to achieving arbitrary spectrum selectivity in photonic systems have entailed combining multiple resonantly emissive elements together to achieve a range of spectral profiles through numerical optimization, with a universal theoretical framework lacking. Here, we develop a temporal coupled mode theory for thermal emission from multiple, arbtirarily-coupled resonators. We validate our theory against numerical simulations of complex two- and three-dimensional nanophotonic thermal emitters, highlighting the anomalous thermal emission spectra that can emerge when multiple resonators with arbitrary properties couple to each other with varying strengths.

physics.optics↗

Neutron-proton differential transverse flow in $^{132}$Sn + $^{124}$Sn collisions at 270 MeV/nucleon

Within a transport model, we study the neutron-proton differential transverse flow and its excitation function in central $^{132}$Sn + $^{124}$Sn collisions at 270 MeV/nucleon. To more accurately evaluate effects of the high-density behavior of symmetry energy \esym on this observable, we also consider the uncertainties of \esym around the saturation density $ρ_{0}$. It is shown that the neutron-proton differential transverse flow and its excitation function are mainly sensitive to the slope $L$ of \esym at $ρ_{0}$. However, the effects of low-density behavior of \esym on this observable should also be considered. Therefore, it is suggested that measurements of the neutron-proton differential transverse flow and its excitation function may provide useful complements to the constraints on $L$ extracted from the spectral pion ratio in S$π$RIT experiments.

nucl-th↗

VectorFlow: Combining Images and Vectors for Traffic Occupancy and Flow Prediction

Predicting future behaviors of road agents is a key task in autonomous driving. While existing models have demonstrated great success in predicting marginal agent future behaviors, it remains a challenge to efficiently predict consistent joint behaviors of multiple agents. Recently, the occupancy flow fields representation was proposed to represent joint future states of road agents through a combination of occupancy grid and flow, which supports efficient and consistent joint predictions. In this work, we propose a novel occupancy flow fields predictor to produce accurate occupancy and flow predictions, by combining the power of an image encoder that learns features from a rasterized traffic image and a vector encoder that captures information of continuous agent trajectories and map states. The two encoded features are fused by multiple attention modules before generating final predictions. Our simple but effective model ranks 3rd place on the Waymo Open Dataset Occupancy and Flow Prediction Challenge, and achieves the best performance in the occluded occupancy and flow prediction task.

cs.CV↗

BERT-based Financial Sentiment Index and LSTM-based Stock Return Predictability

Traditional sentiment construction in finance relies heavily on the dictionary-based approach, with a few exceptions using simple machine learning techniques such as Naive Bayes classifier. While the current literature has not yet invoked the rapid advancement in the natural language processing, we construct in this research a textual-based sentiment index using a well-known pre-trained model BERT developed by Google, especially for three actively trading individual stocks in Hong Kong market with at the same time the hot discussion on Weibo.com. On the one hand, we demonstrate a significant enhancement of applying BERT in financial sentiment analysis when compared with the existing models. On the other hand, by combining with the other two commonly-used methods when it comes to building the sentiment index in the financial literature, i.e., the option-implied and the market-implied approaches, we propose a more general and comprehensive framework for the financial sentiment analysis, and further provide convincing outcomes for the predictability of individual stock return by combining LSTM (with a feature of a nonlinear mapping). It is significantly distinct with the dominating econometric methods in sentiment influence analysis which are all of a nature of linear regression.

q-fin.ST↗