Searcharxiv⌕ Search

arXiv subjects

Yuanyuan Yang

Publications and source records attributed to Yuanyuan Yang.

At least 37 records · Page 2Linked to original sources

Compton scattering of electrons in the intergalactic medium

This paper investigates the distribution and implications of cosmic ray electrons within the intergalactic medium (IGM). Utilizing a synthesis model of the extragalactic background, we evolve the spectrum of Compton-included cosmic rays. The energy density distribution of cosmic ray electrons peaks at redshift $z \approx2$, and peaks in the $\sim$MeV range. The fractional contribution of cosmic ray pressure to the general IGM pressure progressively increases toward lower redshift. At mean density, the ratio of cosmic ray electron to thermal pressure in the IGM $ P_{\rm CRe} / P_{\rm th}$ is 0.3% at $z=2$, rising to 1.0% at $z=1$, and 1.8% at $z=0.1$ (considering only the cosmic rays produced locally by Compton scattering). We compute the linear Landau damping rate of plasma oscillations in the IGM caused by the $\sim$MeV cosmic ray electrons, and find it to be of order $\sim 10^{-6}\,\rm s^{-1}$ for wavenumbers $1.2\lesssim ck/ω_{\rm p}\lesssim 5$ at $z=2$ and mean density (where $ω_{\rm p}$ is the plasma frequency). This strongly affects the fate of TeV $e^+e^-$ pair beams produced by blazars, which are potentially unstable to oblique instabilities involving plasma oscillations with wavenumber $ck/ω_{\rm p}\approx\secθ$ ($θ$ being the angle between the beam and wave vector). Linear Landau damping is at least thousands of times faster than either pair beam instability growth or collisional effects; it thus turns off the pair beam instability except for modes with very small $θ$ ($ck/ω_{\rm p}\rightarrow 1$, where linear Landau damping is kinematically suppressed). This leaves open the question of whether the pair beam instability is turned off entirely, or can still proceed via the small-$θ$ modes.

astro-ph.HE↗

Fast Heavy Inner Product Identification Between Weights and Inputs in Neural Network Training

In this paper, we consider a heavy inner product identification problem, which generalizes the Light Bulb problem~(\cite{prr89}): Given two sets $A \subset \{-1,+1\}^d$ and $B \subset \{-1,+1\}^d$ with $|A|=|B| = n$, if there are exact $k$ pairs whose inner product passes a certain threshold, i.e., $\{(a_1, b_1), \cdots, (a_k, b_k)\} \subset A \times B$ such that $\forall i \in [k], \langle a_i,b_i \rangle \geq ρ\cdot d$, for a threshold $ρ\in (0,1)$, the goal is to identify those $k$ heavy inner products. We provide an algorithm that runs in $O(n^{2 ω/ 3+ o(1)})$ time to find the $k$ inner product pairs that surpass $ρ\cdot d$ threshold with high probability, where $ω$ is the current matrix multiplication exponent. By solving this problem, our method speed up the training of neural networks with ReLU activation function.

cs.LG↗

Dueling Optimization with a Monotone Adversary

We introduce and study the problem of dueling optimization with a monotone adversary, which is a generalization of (noiseless) dueling convex optimization. The goal is to design an online algorithm to find a minimizer $\mathbf{x}^{*}$ for a function $f\colon X \to \mathbb{R}$, where $X \subseteq \mathbb{R}^d$. In each round, the algorithm submits a pair of guesses, i.e., $\mathbf{x}^{(1)}$ and $\mathbf{x}^{(2)}$, and the adversary responds with any point in the space that is at least as good as both guesses. The cost of each query is the suboptimality of the worse of the two guesses; i.e., ${\max} \left( f(\mathbf{x}^{(1)}), f(\mathbf{x}^{(2)}) \right) - f(\mathbf{x}^{*})$. The goal is to minimize the number of iterations required to find an $\varepsilon$-optimal point and to minimize the total cost (regret) of the guesses over many rounds. Our main result is an efficient randomized algorithm for several natural choices of the function $f$ and set $X$ that incurs cost $O(d)$ and iteration complexity $O(d\log(1/\varepsilon)^2)$. Moreover, our dependence on $d$ is asymptotically optimal, as we show examples in which any randomized algorithm for this problem must incur $Ω(d)$ cost and iteration complexity.

cs.DS↗

A Survey of Robustness and Safety of 2D and 3D Deep Learning Models Against Adversarial Attacks

Benefiting from the rapid development of deep learning, 2D and 3D computer vision applications are deployed in many safe-critical systems, such as autopilot and identity authentication. However, deep learning models are not trustworthy enough because of their limited robustness against adversarial attacks. The physically realizable adversarial attacks further pose fatal threats to the application and human safety. Lots of papers have emerged to investigate the robustness and safety of deep learning models against adversarial attacks. To lead to trustworthy AI, we first construct a general threat model from different perspectives and then comprehensively review the latest progress of both 2D and 3D adversarial attacks. We extend the concept of adversarial examples beyond imperceptive perturbations and collate over 170 papers to give an overview of deep learning model robustness against various adversarial attacks. To the best of our knowledge, we are the first to systematically investigate adversarial attacks for 3D models, a flourishing field applied to many real-world applications. In addition, we examine physical adversarial attacks that lead to safety violations. Last but not least, we summarize present popular topics, give insights on challenges, and shed light on future research on trustworthy AI.

cs.LG↗

Summary of ChatGPT-Related Research and Perspective Towards the Future of Large Language Models

This paper presents a comprehensive survey of ChatGPT-related (GPT-3.5 and GPT-4) research, state-of-the-art large language models (LLM) from the GPT series, and their prospective applications across diverse domains. Indeed, key innovations such as large-scale pre-training that captures knowledge across the entire world wide web, instruction fine-tuning and Reinforcement Learning from Human Feedback (RLHF) have played significant roles in enhancing LLMs' adaptability and performance. We performed an in-depth analysis of 194 relevant papers on arXiv, encompassing trend analysis, word cloud representation, and distribution analysis across various application domains. The findings reveal a significant and increasing interest in ChatGPT-related research, predominantly centered on direct natural language processing applications, while also demonstrating considerable potential in areas ranging from education and history to mathematics, medicine, and physics. This study endeavors to furnish insights into ChatGPT's capabilities, potential implications, ethical concerns, and offer direction for future advancements in this field.

cs.CL↗

Efficient SGD Neural Network Training via Sublinear Activated Neuron Identification

Deep learning has been widely used in many fields, but the model training process usually consumes massive computational resources and time. Therefore, designing an efficient neural network training method with a provable convergence guarantee is a fundamental and important research question. In this paper, we present a static half-space report data structure that consists of a fully connected two-layer neural network for shifted ReLU activation to enable activated neuron identification in sublinear time via geometric search. We also prove that our algorithm can converge in $O(M^2/ε^2)$ time with network size quadratic in the coefficient norm upper bound $M$ and error term $ε$.

cs.LG↗

Entanglement Routing over Quantum Networks Using Greenberger-Horne-Zeilinger Measurements

Generating a long-distance quantum entanglement is one of the most essential functions of a quantum network to support quantum communication and computing applications. The successful entanglement rate during a probabilistic entanglement process decreases dramatically with distance, and swapping is a widely-applied quantum technique to address this issue. Most existing entanglement routing protocols use a classic entanglement-swapping method based on Bell State measurements that can only fuse two successful entanglement links. This paper appeals to a more general and efficient swapping method, namely n-fusion based on Greenberger-Horne-Zeilinger measurements that can fuse n successful entanglement links, to maximize the entanglement rate for multiple quantum-user pairs over a quantum network. We propose efficient entanglement routing algorithms that utilize the properties of n-fusion for quantum networks with general topologies. Evaluation results highlight that our proposed algorithm under n-fusion can greatly improve the network performance compared with existing ones.

cs.NI↗

On Newton Screening

Screening and working set techniques are important approaches to reducing the size of an optimization problem. They have been widely used in accelerating first-order methods for solving large-scale sparse learning problems. In this paper, we develop a new screening method called Newton screening (NS) which is a generalized Newton method with a built-in screening mechanism. We derive an equivalent KKT system for the Lasso and utilize a generalized Newton method to solve the KKT equations. Based on this KKT system, a built-in working set with a relatively small size is first determined using the sum of primal and dual variables generated from the previous iteration, then the primal variable is updated by solving a least-squares problem on the working set and the dual variable updated based on a closed-form expression. Moreover, we consider a sequential version of Newton screening (SNS) with a warm-start strategy. We show that NS possesses an optimal convergence property in the sense that it achieves one-step local convergence. Under certain regularity conditions on the feature matrix, we show that SNS hits a solution with the same signs as the underlying true target and achieves a sharp estimation error bound with high probability. Simulation studies and real data analysis support our theoretical results and demonstrate that SNS is faster and more accurate than several state-of-the-art methods in our comparative studies.

stat.ML↗

The SLAM Hive Benchmarking Suite

Benchmarking Simultaneous Localization and Mapping (SLAM) algorithms is important to scientists and users of robotic systems alike. But through their many configuration options in hardware and software, SLAM systems feature a vast parameter space that scientists up to now were not able to explore. The proposed SLAM Hive Benchmarking Suite is able to analyze SLAM algorithms in 1000's of mapping runs, through its utilization of container technology and deployment in a cluster. This paper presents the architecture and open source implementation of SLAM Hive and compares it to existing efforts on SLAM evaluation. Furthermore, we highlight the function of SLAM Hive by exploring some open source algorithms on public datasets in terms of accuracy. We compare the algorithms against each other and evaluate how parameters effect not only accuracy but also CPU and memory usage. Through this we show that SLAM Hive can become an essential tool for proper comparisons and evaluations of SLAM algorithms and thus drive the scientific development in the research on SLAM.

cs.RO↗

Lyman-α polarization from cosmological ionization fronts: I. Radiative transfer simulations

In this paper, we present the formalism of simulating Lyman-$α$ emission and polarization around reionization ($z$ = 8) from a plane-parallel ionization front. We accomplish this by using a Monte Carlo method to simulate the production of a Lyman-$α$ photon, its propagation through an ionization front, and the eventual escape of this photon. This paper focuses on the relation of the input parameters of ionization front speed $U$, blackbody temperature $T_{\rm bb}$, and neutral hydrogen density $n_{\rm HI}$, on intensity $I$ and polarized intensity $P$ as seen by a distant observer. The resulting values of intensity range from $3.18\times 10^{-14}$ erg/cm$^{2}$/s/sr to $1.96 \times 10^{-9}$ erg/cm$^{2}$/s/sr , and the polarized intensity ranges from $5.73\times 10^{-17}$ erg/cm$^{2}$/s/sr to $5.31 \times 10^{-12}$ erg/cm$^{2}$/s/sr. We found that higher $T_{\rm bb}$, higher $U$, and higher $n_{\rm HI}$ contribute to higher intensity, as well as polarized intensity, though the strongest dependence was on the hydrogen density. The dependence of viewing angle of the front is also explored. We present tests to support the validity model, which makes the model suitable for further use in a following paper where we will calculate the intensity and polarized intensity power spectrum on a full reionization simulation.

astro-ph.CO↗

Lyman-$α$ polarization from cosmological ionization fronts: II. Implications for intensity mapping

This is the second paper in a series whose aim is to predict the power spectrum of intensity and polarized intensity from cosmic reionization fronts. After building the analytic models for intensity and polarized intensity calculations in paper I, here we apply these models to simulations of reionization. We construct a geometric model for identifying front boundaries, calculate the intensity and polarized intensity for each front, and compute a power spectrum of these results. This method was applied to different simulation sizes and resolutions, so we ensure that our results are convergent. We find that the power spectrum of fluctuations at $z=8$ in a bin of width $Δz=0.5$ ($λ/Δλ=18$) is $Δ_\ell \equiv [\ell(\ell+1)C_\ell/2π]^{1/2}$ is $3.2\times 10^{-11}$ erg s$^{-1}$ cm$^{-2}$ sr$^{-1}$ for the intensity $I$, $7.6\times10^{-13}$ erg s$^{-1}$ cm$^{-2}$ sr$^{-1}$ for the $E$-mode polarization, and $5.8\times10^{-13}$ erg s$^{-1}$ cm$^{-2}$ sr$^{-1}$ for the $B$-mode polarization at $\ell=1.5\times10^4$. After computing the power spectrum, we compare results to detectable scales and discuss implications for observing this signal based on a proposed experiment. We find that, while fundamental physics does not exclude this kind of mapping from being attainable, an experiment would need to be highly ambitious and require significant advances to make mapping Lyman-$α$ polarization from cosmic reionization fronts a feasible goal.

astro-ph.CO↗

A sample-position-autocorrection system with precision better than 1 \um~in angle-resolved photoemission experiments

We present the development of a high-precision sample-position-autocorrection system for photoemission experiments. A binocular vision method based on image pattern matching calculations was realized to track the sample position with an accuracy better than 1 \um, which was much smaller than the spot size of the incident laser. We illustrate the performance of the sample-position-autocorrection system with representative photoemission data on the topological insulator Bi$_2$Se$_3$ and an optimally-doped cuprate superconductor \Bi. Our method provides new possibilities for studying the temperature-dependent electronic structures in quantum materials by laser-based or spatially resolved photoemission systems with high precision and efficiency.

cond-mat.supr-con↗

A Nearly Optimal Size Coreset Algorithm with Nearly Linear Time

A coreset is a point set containing information about geometric properties of a larger point set. A series of previous works show that in many machine learning problems, especially in clustering problems, coreset could be very useful to build efficient algorithms. Two main measures of an coreset construction algorithm's performance are the running time of the algorithm and the size of the coreset output by the algorithm. In this paper we study the construction of coresets for the $(k,z)$-clustering problem, which is a generalization of $k$-means and $k$-median problem. By properly designing a sketching-based distance estimation data structure, we propose faster algorithms that construct coresets with matching size of the state-of-the-art results.

cs.DS↗

Deep Neural Networks with ReLU-Sine-Exponential Activations Break Curse of Dimensionality in Approximation on Hölder Class

In this paper, we construct neural networks with ReLU, sine and $2^x$ as activation functions. For general continuous $f$ defined on $[0,1]^d$ with continuity modulus $ω_f(\cdot)$, we construct ReLU-sine-$2^x$ networks that enjoy an approximation rate $\mathcal{O}(ω_f(\sqrt{d})\cdot2^{-M}+ω_{f}\left(\frac{\sqrt{d}}{N}\right))$, where $M,N\in \mathbb{N}^{+}$ denote the hyperparameters related to widths of the networks. As a consequence, we can construct ReLU-sine-$2^x$ network with the depth $5$ and width $\max\left\{\left\lceil2d^{3/2}\left(\frac{3μ}ε\right)^{1/α}\right\rceil,2\left\lceil\log_2\frac{3μd^{α/2}}{2ε}\right\rceil+2\right\}$ that approximates $f\in \mathcal{H}_μ^α([0,1]^d)$ within a given tolerance $ε>0$ measured in $L^p$ norm $p\in[1,\infty)$, where $\mathcal{H}_μ^α([0,1]^d)$ denotes the Hölder continuous function class defined on $[0,1]^d$ with order $α\in (0,1]$ and constant $μ> 0$. Therefore, the ReLU-sine-$2^x$ networks overcome the curse of dimensionality on $\mathcal{H}_μ^α([0,1]^d)$. In addition to its supper expressive power, functions implemented by ReLU-sine-$2^x$ networks are (generalized) differentiable, enabling us to apply SGD to train.

cs.LG↗

Accelerating Frank-Wolfe Algorithm using Low-Dimensional and Adaptive Data Structures

In this paper, we study the problem of speeding up a type of optimization algorithms called Frank-Wolfe, a conditional gradient method. We develop and employ two novel inner product search data structures, improving the prior fastest algorithm in [Shrivastava, Song and Xu, NeurIPS 2021]. * The first data structure uses low-dimensional random projection to reduce the problem to a lower dimension, then uses efficient inner product data structure. It has preprocessing time $\tilde O(nd^{ω-1}+dn^{1+o(1)})$ and per iteration cost $\tilde O(d+n^ρ)$ for small constant $ρ$. * The second data structure leverages the recent development in adaptive inner product search data structure that can output estimations to all inner products. It has preprocessing time $\tilde O(nd)$ and per iteration cost $\tilde O(d+n)$. The first algorithm improves the state-of-the-art (with preprocessing time $\tilde O(d^2n^{1+o(1)})$ and per iteration cost $\tilde O(dn^ρ)$) in all cases, while the second one provides an even faster preprocessing time and is suitable when the number of iterations is small.

cs.DS↗

Anomalous contribution to the nematic electronic states from the structural transition in FeSe revealed by time- and angle-resolved photoemission spectroscopy

High-resolution time- and angle-resolved photoemission measurements were made on FeSe superconductors. With ultrafast photoexcitation, two critical excitation fluences that correspond to two ultrafast electronic phase transitions were found only in the $d_{yz}$-orbit-derived band near the Brillouin-zone center within our time and energy resolution. Upon comparison to the detailed temperature dependent measurements, we conclude that there are two equilibrium electronic phase transitions (at approximately 90 and 120 K) above the superconducting transition temperature, and an anomalous contribution on the scale of 10 meV to the nematic states from the structural transition is experimentally determined. Our observations strongly suggest that the electronic phase transition at 120 K must be taken into account in the energy band development of FeSe, and, furthermore, the contribution of the structural transition plays an important role in the nematic phase of iron-based high-temperature superconductors.

cond-mat.supr-con↗

Multi-Entanglement Routing Design over Quantum Networks

Quantum networks are considered as a promising future platform for quantum information exchange and quantum applications, which have capabilities far beyond the traditional communication networks. Remote quantum entanglement is an essential component of a quantum network. How to efficiently design a multi-routing entanglement protocol is a fundamental yet challenging problem. In this paper, we study a quantum entanglement routing problem to simultaneously maximize the number of quantum-user pairs and their expected throughput. Our approach is to formulate the problem as two sequential integer programming steps. We propose efficient entanglement routing algorithms for the two integer programming steps and analyze their time complexity and performance bounds. Results of evaluation highlight that our approach outperforms existing solutions in both served quantum-user pairs numbers and the network expected throughput.

cs.NI↗

Cluster on Wheels

This paper presents a very compact 16-node cluster that is the core of a future robot for collecting and storing massive amounts of sensor data for research on Simultaneous Localization and Mapping (SLAM). To the best of our knowledge, this is the first time that such a cluster is used in robotics. We first present the requirements and different options for computing of such a robot and then show the hardware and software of our solution in detail. The cluster consists of 16 nodes of AMD Ryzen 7 5700U CPUs with a total of 128 cores. As a system that is to be used on a Clearpath Husky robot, it is very small in size, can be operated from battery power and has all required power and networking components integrated. Stress tests on the completed cluster show that it performs well.

cs.RO↗