arXiv subjects

Jie Wang

Publications and source records attributed to Jie Wang.

At least 379 records · Page 21Linked to original sources

arXiv2023

New Continuum Observations of the Andromeda galaxy M31 with FAST

We present a new total intensity image of M31 at 1.248 GHz, observed with the Five-hundred-meter Aperture Spherical radio telescope (FAST) with an angular resolution of 4 arcmin and a sensitivity of about 16 mK. The new FAST image clearly reveals weak emission outside the ring due to its high sensitivity on large-scale structures. We derive a scale length of 2.7 kpc for the cosmic ray electrons and find that the cosmic ray electrons propagate mainly through diffusion by comparing the scale length at 4.8 GHz. The spectral index of the total intensity varies along the ring, which can be attributed to the variation of the spectra of synchrotron emission. This variation is likely caused by the change of star formation rates along the ring. We find that the azimuthal profile of the non-thermal emission can be interpreted by an axisymmetric large-scale magnetic field with varying pitch angle along the ring, indicating a complicated magnetic field configuration in M31.

astro-ph.GA↗

arXiv2023

Testing the Renormalization of the von Klitzing Constant by Cavity Vacuum Fields

In light of recent developments demonstrating the impact of cavity vacuum fields inducing the breakdown of topological protection in the integer quantum Hall effect, a compelling question arises: what effects might cavity vacuum fields have on fundamental constants in solid-state systems? In this work we present an experiment that assesses the possibility of the von Klitzing constant itself being modified. By employing a Wheatstone bridge, we precisely measure the difference between the quantized Hall resistance of a cavity-embedded Hall bar and the resistance standard, achieving an accuracy down to 1 part in 105 for the lowest Landau level. While our results do not suggest any deviation that could imply a modified Hall resistance, our work represents pioneering efforts in exploring the fundamental implications of vacuum fields in solid-state systems.

cond-mat.mes-hall↗

arXiv2023

Formation of a massive lenticular galaxy under the tidal interaction with a group of dwarf galaxies

Based on the atomic-hydrogen (HI) observations using the Five-hundred-meter Aperture Spherical radio Telescope (FAST), we present a detailed study of the gas-rich massive S0 galaxy NGC 1023 in a nearby galaxy group. The presence of an HI extended warped disk in NGC 1023 indicates that this S0 galaxy originated from a spiral galaxy. The data also suggest that NGC 1023 is interacting with four dwarf galaxies. In particular, one of the largest dwarf galaxies has fallen into the gas disk of NGC 1023, forming a rare bright-dark galaxy pair with a large gas clump. This clump shows the signature of a galaxy but has no optical counterpart, implying that it is a newly formed starless galaxy. Our results firstly suggest that a massive S0 galaxy in a galaxy group can form via the morphological transformation from a spiral under the joint action of multiple tidal interactions.

astro-ph.GA↗

arXiv2023

Contextual Stochastic Bilevel Optimization

We introduce contextual stochastic bilevel optimization (CSBO) -- a stochastic bilevel optimization framework with the lower-level problem minimizing an expectation conditioned on some contextual information and the upper-level decision variable. This framework extends classical stochastic bilevel optimization when the lower-level decision maker responds optimally not only to the decision of the upper-level decision maker but also to some side information and when there are multiple or even infinite many followers. It captures important applications such as meta-learning, personalized federated learning, end-to-end learning, and Wasserstein distributionally robust optimization with side information (WDRO-SI). Due to the presence of contextual information, existing single-loop methods for classical stochastic bilevel optimization are unable to converge. To overcome this challenge, we introduce an efficient double-loop gradient method based on the Multilevel Monte-Carlo (MLMC) technique and establish its sample and computational complexities. When specialized to stochastic nonconvex optimization, our method matches existing lower bounds. For meta-learning, the complexity of our method does not depend on the number of tasks. Numerical experiments further validate our theoretical results.

math.OC↗

arXiv2023

State Sequences Prediction via Fourier Transform for Representation Learning

While deep reinforcement learning (RL) has been demonstrated effective in solving complex control tasks, sample efficiency remains a key challenge due to the large amounts of data required for remarkable performance. Existing research explores the application of representation learning for data-efficient RL, e.g., learning predictive representations by predicting long-term future states. However, many existing methods do not fully exploit the structural information inherent in sequential state signals, which can potentially improve the quality of long-term decision-making but is difficult to discern in the time domain. To tackle this problem, we propose State Sequences Prediction via Fourier Transform (SPF), a novel method that exploits the frequency domain of state sequences to extract the underlying patterns in time series data for learning expressive representations efficiently. Specifically, we theoretically analyze the existence of structural information in state sequences, which is closely related to policy performance and signal regularity, and then propose to predict the Fourier transform of infinite-step future state sequences to extract such information. One of the appealing features of SPF is that it is simple to implement while not requiring storage of infinite-step future states as prediction targets. Experiments demonstrate that the proposed method outperforms several state-of-the-art algorithms in terms of both sample efficiency and performance.

cs.LG↗

arXiv2023

Accelerate Presolve in Large-Scale Linear Programming via Reinforcement Learning

Large-scale LP problems from industry usually contain much redundancy that severely hurts the efficiency and reliability of solving LPs, making presolve (i.e., the problem simplification module) one of the most critical components in modern LP solvers. However, how to design high-quality presolve routines -- that is, the program determining (P1) which presolvers to select, (P2) in what order to execute, and (P3) when to stop -- remains a highly challenging task due to the extensive requirements on expert knowledge and the large search space. Due to the sequential decision property of the task and the lack of expert demonstrations, we propose a simple and efficient reinforcement learning (RL) framework -- namely, reinforcement learning for presolve (RL4Presolve) -- to tackle (P1)-(P3) simultaneously. Specifically, we formulate the routine design task as a Markov decision process and propose an RL framework with adaptive action sequences to generate high-quality presolve routines efficiently. Note that adaptive action sequences help learn complex behaviors efficiently and adapt to various benchmarks. Experiments on two solvers (open-source and commercial) and eight benchmarks (real-world and synthetic) demonstrate that RL4Presolve significantly and consistently improves the efficiency of solving large-scale LPs, especially on benchmarks from industry. Furthermore, we optimize the hard-coded presolve routines in LP solvers by extracting rules from learned policies for simple and efficient deployment to Huawei's supply chain. The results show encouraging economic and academic potential for incorporating machine learning to modern solvers.

cs.LG↗

arXiv2023

Channel Estimation via Loss Field: Accurate Site-Trained Modeling for Shadowing Prediction

Future mobile ad hoc networks will share spectrum between many users. Channels will be assigned on the fly to guarantee signal and interference power requirements for requested links. Channel losses must be re-estimated between many pairs of users as they move and as environmental conditions change. Computational complexity must be low, precluding the use of some accurate but computationally intensive site-specific channel models. Channel model errors must be low, precluding the use of standard statistical channel models. We propose a new channel model, CELF, which uses channel loss measurements from a deployed network in the area and a Bayesian linear regression method to estimate a site-specific loss field for the area. The loss field is explainable as the site's 'shadowing' of the radio propagation across the area of interest, but it requires no site-specific terrain or building information. Then, for any arbitrary pair of transmitter and receiver positions, CELF sums the loss field near the link line to estimate its channel loss. We use extensive measurements to show that CELF lowers the variance of channel estimates by up to 56%. It outperforms 3 popular machine learning methods in variance reduction and training efficiency.

eess.SP↗

arXiv2023

Exploring the relationship between response time sequence in scale answering process and severity of insomnia: a machine learning approach

Objectives: The study aims to investigate the relationship between insomnia and response time. Additionally, it aims to develop a machine learning model to predict the presence of insomnia in participants using response time data. Methods: A mobile application was designed to administer scale tests and collect response time data from 2729 participants. The relationship between symptom severity and response time was explored, and a machine learning model was developed to predict the presence of insomnia. Results: The result revealed a statistically significant difference (p<.001) in the total response time between participants with or without insomnia symptoms. A correlation was observed between the severity of specific insomnia aspects and response times at the individual questions level. The machine learning model demonstrated a high predictive accuracy of 0.743 in predicting insomnia symptoms based on response time data. Conclusions: These findings highlight the potential utility of response time data to evaluate cognitive and psychological measures, demonstrating the effectiveness of using response time as a diagnostic tool in the assessment of insomnia.

cs.LG↗

arXiv2023

Exploiting Term Sparsity in Moment-SOS hierarchy for Dynamical Systems

In this paper, we develop a dynamical system counterpart to the term sparsity sum-of-squares (TSSOS) algorithm proposed for static polynomial optimization. This allows for computational savings and improved scalability while preserving convergence guarantees when sum-of-squares methods are applied to problems from dynamical systems, including the problems of approximating region of attraction, the maximum positively invariant set, and the global attractor. At its core, the method exploits the algebraic structure of the data, thereby complementing existing methods that exploit causality relations among the states of the dynamical system. The procedure encompasses sign symmetries of the dynamical system as was already revealed for polynomial optimization. Numerical examples demonstrate the efficiency of the approach in the presence of this type of sparsity.

math.OC↗

arXiv2023

Composite Fermi Liquid at Zero Magnetic Field in Twisted MoTe$_2$

The pursuit of exotic phases of matter outside of the extreme conditions of a quantizing magnetic field has been a long standing quest of solid state physics. Recent experiments have observed spontaneous valley polarization and fractional Chern insulators (FCIs) in zero magnetic field in twisted bilayers of MoTe$_2$, at partial filling of the topological valence band ($ν=-2/3$ and $-3/5$). We study the topological valence band at $\textit{half}$ filling, using exact diagonalization and density matrix renormalization group calculations. We discover a composite Fermi liquid (CFL) phase even at zero magnetic field that covers a large portion of the phase diagram centered around twist angle ${\sim}3.6^\circ$. The CFL is a non-Fermi liquid phase that shows metallic behavior despite the absence of Landau quasiparticles. We discuss experimental implications including the competition between the CFL and a Fermi liquid, which can be tuned with a displacement field. The topological valence band has excellent quantum geometry over a wide range of twist angles and a small bandwidth that is, remarkably, reduced by interactions for a range of angles. These key properties are responsible for stabilizing the exotic quantum Hall phases we find at zero field. Finally, we present an optical signature involving "extinguished" optical responses as a means to identify Chern bands with ideal quantum geometry.

cond-mat.str-el↗

arXiv2023

Boundedness and gradient estimates for solutions to $Δu + a(x)u\log u + b(x)u = 0$ on Riemannian manifolds

In this paper, combining Nash-Moser iteration and Sallof-Coste type Sobolev ineualities, we establish fundamental and concise $C^0$ and $C^1$ estimates for solutions to a class of nonlinear elliptic equations of the form $$Δu(x)+a(x)u(x)\ln u(x)+b(x)u(x)=0,$$ which possesses abundant geometric backgrounds. Utilizing these estimates which retrieve more geometric information, we obtain some further properties of such solutions. Especially, we prove a local Liouville type theorem of corresponding constant coefficient equation.

math.AP↗

arXiv2023

Sample-adaptive Augmentation for Point Cloud Recognition Against Real-world Corruptions

Robust 3D perception under corruption has become an essential task for the realm of 3D vision. While current data augmentation techniques usually perform random transformations on all point cloud objects in an offline way and ignore the structure of the samples, resulting in over-or-under enhancement. In this work, we propose an alternative to make sample-adaptive transformations based on the structure of the sample to cope with potential corruption via an auto-augmentation framework, named as AdaptPoint. Specially, we leverage a imitator, consisting of a Deformation Controller and a Mask Controller, respectively in charge of predicting deformation parameters and producing a per-point mask, based on the intrinsic structural information of the input point cloud, and then conduct corruption simulations on top. Then a discriminator is utilized to prevent the generation of excessive corruption that deviates from the original data distribution. In addition, a perception-guidance feedback mechanism is incorporated to guide the generation of samples with appropriate difficulty level. Furthermore, to address the paucity of real-world corrupted point cloud, we also introduce a new dataset ScanObjectNN-C, that exhibits greater similarity to actual data in real-world environments, especially when contrasted with preceding CAD datasets. Experiments show that our method achieves state-of-the-art results on multiple corruption benchmarks, including ModelNet-C, our ScanObjectNN-C, and ShapeNet-C.

cs.CV↗

arXiv2023

A Ground Segmentation Method Based on Point Cloud Map for Unstructured Roads

Ground segmentation, as the basic task of unmanned intelligent perception, provides an important support for the target detection task. Unstructured road scenes represented by open-pit mines have irregular boundary lines and uneven road surfaces, which lead to segmentation errors in current ground segmentation methods. To solve this problem, a ground segmentation method based on point cloud map is proposed, which involves three parts: region of interest extraction, point cloud registration and background subtraction. Firstly, establishing boundary semantic associations to obtain regions of interest in unstructured roads. Secondly, establishing the location association between point cloud map and the real-time point cloud of region of interest by semantics information. Thirdly, establishing a background model based on Gaussian distribution according to location association, and segments the ground in real-time point cloud by the background substraction method. Experimental results show that the correct segmentation rate of ground points is 99.95%, and the running time is 26ms. Compared with state of the art ground segmentation algorithm Patchwork++, the average accuracy of ground point segmentation is increased by 7.43%, and the running time is increased by 17ms. Furthermore, the proposed method is practically applied to unstructured road scenarios represented by open pit mines.

cs.CV↗

arXiv2023

Context-Aware Prompt Tuning for Vision-Language Model with Dual-Alignment

Large-scale vision-language models (VLMs), e.g., CLIP, learn broad visual concepts from tedious training data, showing superb generalization ability. Amount of prompt learning methods have been proposed to efficiently adapt the VLMs to downstream tasks with only a few training samples. We introduce a novel method to improve the prompt learning of vision-language models by incorporating pre-trained large language models (LLMs), called Dual-Aligned Prompt Tuning (DuAl-PT). Learnable prompts, like CoOp, implicitly model the context through end-to-end training, which are difficult to control and interpret. While explicit context descriptions generated by LLMs, like GPT-3, can be directly used for zero-shot classification, such prompts are overly relying on LLMs and still underexplored in few-shot domains. With DuAl-PT, we propose to learn more context-aware prompts, benefiting from both explicit and implicit context modeling. To achieve this, we introduce a pre-trained LLM to generate context descriptions, and we encourage the prompts to learn from the LLM's knowledge by alignment, as well as the alignment between prompts and local image features. Empirically, DuAl-PT achieves superior performance on 11 downstream datasets on few-shot recognition and base-to-new generalization. Hopefully, DuAl-PT can serve as a strong baseline. Code will be available.

cs.CV↗

arXiv2023

A Circuit Domain Generalization Framework for Efficient Logic Synthesis in Chip Design

Logic Synthesis (LS) plays a vital role in chip design -- a cornerstone of the semiconductor industry. A key task in LS is to transform circuits -- modeled by directed acyclic graphs (DAGs) -- into simplified circuits with equivalent functionalities. To tackle this task, many LS operators apply transformations to subgraphs -- rooted at each node on an input DAG -- sequentially. However, we found that a large number of transformations are ineffective, which makes applying these operators highly time-consuming. In particular, we notice that the runtime of the Resub and Mfs2 operators often dominates the overall runtime of LS optimization processes. To address this challenge, we propose a novel data-driven LS operator paradigm, namely PruneX, to reduce ineffective transformations. The major challenge of developing PruneX is to learn models that well generalize to unseen circuits, i.e., the out-of-distribution (OOD) generalization problem. Thus, the major technical contribution of PruneX is the novel circuit domain generalization framework, which learns domain-invariant representations based on the transformation-invariant domain-knowledge. To the best of our knowledge, PruneX is the first approach to tackle the OOD problem in LS operators. We integrate PruneX with the aforementioned Resub and Mfs2 operators. Experiments demonstrate that PruneX significantly improves their efficiency while keeping comparable optimization performance on industrial and very large-scale circuits, achieving up to $3.1\times$ faster runtime.

cs.AR↗

arXiv2023

Atomic-Scale Tracking Phase Transition Dynamics of Berezinskii-Kosterlitz-Thouless Polar Vortex-Antivortex

Particle-like topologies, such as vortex-antivortex (V-AV) pairs, have garnered significant attention in the field of condensed matter. However, the detailed phase transition dynamics of V-AV pairs, as exemplified by self-annihilation, motion, and dissociation, have yet to be verified in real space due to the lack of suitable experimental techniques. Here, we employ polar V-AV pairs as a model system and track their transition pathways at atomic resolution with the aid of in situ (scanning) transmission electron microscopy and phase field simulations. We demonstrate the absence of a Berezinskii-Kosterlitz-Thouless phase transition between the room-temperature quasi-long-range ordered ground phase and the high-temperature disordered phase. Instead, we observe polarization suppression in bound V-AV pairs as the temperature increases. Furthermore, electric fields can promote the vortex and antivortex to approach each other and annihilate near the interface. The elucidated intermediate dynamic behaviors of polar V-AV pairs under thermal- and electrical-fields lay the foundation for their potential applications in electronic devices. Moreover, the dynamic behaviors revealed at atomic scale provide us new insights into understanding topological phase of matter and their topological phase transitions.

physics.app-ph↗

arXiv2023

Rigidity and ε-regularity theorems of Ricci shrinkers

In this paper, we study the rigidity and ε-regularity theorems of Ricci shrinkers. First we prove the rigidity of the asymptotic volume ratio and local volume around a base point of a non-compact Ricci shrinker. Next we obtain some ε-regularity theorems of local entropy and curvature, which improve the previous corresponding results essentially and use them to study the structure of Ricci shrinkers at infinity. Especially, if the curvature of a non-compact Ricci shrinker satisfies some natural integral conditions, then it is asymptotic to a cone.

math.DG↗

arXiv2023

State polynomials: positivity, optimization and nonlinear Bell inequalities

This paper introduces state polynomials, i.e., polynomials in noncommuting variables and formal states of their products. A state analog of Artin's solution to Hilbert's 17th problem is proved showing that state polynomials, positive over all matrices and matricial states, are sums of squares with denominators. Somewhat surprisingly, it is also established that a Krivine-Stengle Positivstellensatz fails to hold in the state polynomial setting. Further, archimedean Positivstellensätze in the spirit of Putinar and Helton-McCullough are presented leading to a hierarchy of semidefinite relaxations converging monotonically to the optimum of a state polynomial subject to state constraints. This hierarchy can be seen as a state analog of the Lasserre hierarchy for optimization of polynomials, and the Navascués-Pironio-Acín scheme for optimization of noncommutative polynomials. The motivation behind this theory arises from the study of correlations in quantum networks. Determining the maximal quantum violation of a polynomial Bell inequality for an arbitrary network is reformulated as a state polynomial optimization problem. Several examples of quadratic Bell inequalities in the bipartite and the bilocal tripartite scenario are analyzed. To reduce the size of the constructed SDPs, sparsity, sign symmetry and conditional expectation of the observables' group structure are exploited. To obtain the above-mentioned results, techniques from noncommutative algebra, real algebraic geometry, operator theory, and convex optimization are employed.

math.FA↗