Search

Periodically poled thin-film lithium niobate (TFLN) waveguides, which enable efficient quadratic nonlinear processes, serve as crucial foundation for classical and quantum signal processing with photonic integrated circuits. To expand their application scope, we provide, to our best knowledge, the first investigation of nonlinear conversion processes in periodically poled TFLN waveguides at cryogenic condition. Through systematic experimental characterization, we find that the periodically poled TFLN waveguide maintains consistent conversion efficiencies at both cryogenic and room temperatures for both classical second-harmonic generation and quantum photon-pair generation processes, demonstrating the significant potential of TFLN wavelength conversion devices for cryogenic applications. This breakthrough will foster future scalable quantum photonic systems and optical interfacing among different cryogenic platforms.

How humans can efficiently and effectively acquire images has always been a perennial question. A typical solution is text-to-image retrieval from an existing database given the text query; however, the limited database typically lacks creativity. By contrast, recent breakthroughs in text-to-image generation have made it possible to produce fancy and diverse visual content, but it faces challenges in synthesizing knowledge-intensive images. In this work, we rethink the relationship between text-to-image generation and retrieval and propose a unified framework in the context of Multimodal Large Language Models (MLLMs). Specifically, we first explore the intrinsic discriminative abilities of MLLMs and introduce a generative retrieval method to perform retrieval in a training-free manner. Subsequently, we unify generation and retrieval in an autoregressive generation way and propose an autonomous decision module to choose the best-matched one between generated and retrieved images as the response to the text query. Additionally, we construct a benchmark called TIGeR-Bench, including creative and knowledge-intensive domains, to standardize the evaluation of unified text-to-image generation and retrieval. Extensive experimental results on TIGeR-Bench and two retrieval benchmarks, i.e., Flickr30K and MS-COCO, demonstrate the superiority and effectiveness of our proposed method.

Thin-film periodically poled lithium niobate (TF-PPLN) devices have recently gained prominence for efficient wavelength conversion processes in both classical and quantum applications. However, the patterning and poling of TF-PPLN devices today are mostly performed at chip scales, presenting a significant bottleneck for future large-scale nonlinear photonic systems that require the integration of multiple nonlinear components with consistent performance and low cost. Here, we take a pivotal step towards this goal by developing a wafer-scale TF-PPLN nonlinear photonic platform, leveraging ultraviolet stepper lithography and an automated poling process. To address the inhomogeneous broadening of the quasi-phase matching (QPM) spectrum induced by film thickness variations across the wafer, we propose and demonstrate segmented thermal optic tuning modules that can precisely adjust and align the QPM peak wavelengths in each section. \hl{Using the segmented micro-heaters, we show the successful realignment of inhomogeneously broadened multi-peak QPM spectra with up to 57$\%$ enhancement of conversion efficiency. We achieve a high normalized conversion efficiency of 3802$\%$W$^{-1}$cm$^{-2}$ in a 6 mm long PPLN waveguide, recovering 84$\%$ of the theoretically predicted efficiency in this device.} The advanced fabrication techniques and segmented tuning architectures presented herein pave the way for wafer-scale integration of complex functional nonlinear photonic circuits with applications in quantum information processing, precision sensing and metrology, and low-noise-figure optical signal amplification.

Thin-film lithium niobate (TFLN) based frequency doublers have been widely recognized as essential components for both classical and quantum optical communications. Nonetheless, the efficiency of these devices is hindered by imperfections present in the quasi-phase matching (QPM) spectrum. In this study, we present a thorough analysis of the spectral imperfections in TFLN frequency doublers with varying lengths, ranging from 5 mm to 15 mm. Employing a non-destructive diagnostic method based on scattered light imaging, we identify the sources and waveguide sections that contribute to the imperfections in the QPM spectrum. Furthermore, by mapping the TFLN film thickness across the entire waveguiding regions, we successfully reproduce the QPM spectra numerically, thus confirming the prominent influence of film thickness variations on the observed spectral imperfections. This comprehensive investigation provides valuable insights into the identification and mitigation of spectral imperfections in TFLN-based frequency doublers, paving the way toward the realization of nonlinear optical devices with enhanced efficiency and improved spectral fidelity.

Classical analysis of convex and non-convex optimization methods often requires the Lipshitzness of the gradient, which limits the analysis to functions bounded by quadratics. Recent work relaxed this requirement to a non-uniform smoothness condition with the Hessian norm bounded by an affine function of the gradient norm, and proved convergence in the non-convex setting via gradient clipping, assuming bounded noise. In this paper, we further generalize this non-uniform smoothness condition and develop a simple, yet powerful analysis technique that bounds the gradients along the trajectory, thereby leading to stronger results for both convex and non-convex optimization problems. In particular, we obtain the classical convergence rates for (stochastic) gradient descent and Nesterov's accelerated gradient method in the convex and/or non-convex setting under this general smoothness condition. The new analysis approach does not require gradient clipping and allows heavy-tailed noise with bounded variance in the stochastic setting., Comment: 37 pages

In this paper, we provide a rigorous proof of convergence of the Adaptive Moment Estimate (Adam) algorithm for a wide class of optimization objectives. Despite the popularity and efficiency of the Adam algorithm in training deep neural networks, its theoretical properties are not yet fully understood, and existing convergence proofs require unrealistically strong assumptions, such as globally bounded gradients, to show the convergence to stationary points. In this paper, we show that Adam provably converges to $\epsilon$-stationary points with ${O}(\epsilon^{-4})$ gradient complexity under far more realistic conditions. The key to our analysis is a new proof of boundedness of gradients along the optimization trajectory of Adam, under a generalized smoothness assumption according to which the local smoothness (i.e., Hessian norm when it exists) is bounded by a sub-quadratic function of the gradient norm. Moreover, we propose a variance-reduced version of Adam with an accelerated gradient complexity of ${O}(\epsilon^{-3})$., Comment: 35 pages

Gradient clipping is a standard training technique used in deep learning applications such as large-scale language modeling to mitigate exploding gradients. Recent experimental studies have demonstrated a fairly special behavior in the smoothness of the training objective along its trajectory when trained with gradient clipping. That is, the smoothness grows with the gradient norm. This is in clear contrast to the well-established assumption in folklore non-convex optimization, a.k.a. $L$--smoothness, where the smoothness is assumed to be bounded by a constant $L$ globally. The recently introduced $(L_0,L_1)$--smoothness is a more relaxed notion that captures such behavior in non-convex optimization. In particular, it has been shown that under this relaxed smoothness assumption, SGD with clipping requires $O(\epsilon^{-4})$ stochastic gradient computations to find an $\epsilon$--stationary solution. In this paper, we employ a variance reduction technique, namely SPIDER, and demonstrate that for a carefully designed learning rate, this complexity is improved to $O(\epsilon^{-3})$ which is order-optimal. Our designed learning rate comprises the clipping technique to mitigate the growing smoothness. Moreover, when the objective function is the average of $n$ components, we improve the existing $O(n\epsilon^{-2})$ bound on the stochastic gradient complexity to $O(\sqrt{n} \epsilon^{-2} + n)$, which is order-optimal as well. In addition to being theoretically optimal, SPIDER with our designed parameters demonstrates comparable empirical performance against variance-reduced methods such as SVRG and SARAH in several vision tasks.

Despite the established convergence theory of Optimistic Gradient Descent Ascent (OGDA) and Extragradient (EG) methods for the convex-concave minimax problems, little is known about the theoretical guarantees of these methods in nonconvex settings. To bridge this gap, for the first time, this paper establishes the convergence of OGDA and EG methods under the nonconvex-strongly-concave (NC-SC) and nonconvex-concave (NC-C) settings by providing a unified analysis through the lens of single-call extra-gradient methods. We further establish lower bounds on the convergence of GDA/OGDA/EG, shedding light on the tightness of our analysis. We also conduct experiments supporting our theoretical results. We believe our results will advance the theoretical understanding of OGDA and EG methods for solving complicated nonconvex minimax real-world problems, e.g., Generative Adversarial Networks (GANs) or robust neural networks training.

We simultaneously model the gravitational potential and phase space distribution function (DF) of giant stars near the Sun using the {\it Gaia} DR2 radial velocity catalog. We assume that the Galaxy is in equilibrium and is symmetric about both the spin axis of the disk and the Galactic midplane. The potential is taken as a sum of terms that nominally represent contributions from the gas disk, stellar disk, bulge, and dark matter halo. Our DF model for the giants comprise two components to account for a mix of thin and thick disk stars. The DF for each component is described by an analytic function of the energy, the spin angular momentum, and the vertical energy, in accord with Jeans theorem. We present model predictions for the radial and vertical forces within $\sim 2\,{\rm kpc}$ of the Sun, highlighting the rotation curve and vertical force profile in the Solar Neighbourhood. Finally, we show residuals for star counts in the $R-z$ and $z-v_z$ planes as well as maps of the mean radial and azimuthal velocities in the $z-v_z$ plane. Using our model for the potential, we also examine the star count residuals in action-frequency-angle coordinates. The {\it Gaia} phase spirals, velocity arches, some of the known moving groups and bending modes appear as well-defined features in these maps., Comment: 16 pages, 13 figures

Gradient Descent Ascent (GDA) methods are the mainstream algorithms for minimax optimization in generative adversarial networks (GANs). Convergence properties of GDA have drawn significant interest in the recent literature. Specifically, for $\min_{\mathbf{x}} \max_{\mathbf{y}} f(\mathbf{x};\mathbf{y})$ where $f$ is strongly-concave in $\mathbf{y}$ and possibly nonconvex in $\mathbf{x}$, (Lin et al., 2020) proved the convergence of GDA with a stepsize ratio $\eta_{\mathbf{y}}/\eta_{\mathbf{x}}=\Theta(\kappa^2)$ where $\eta_{\mathbf{x}}$ and $\eta_{\mathbf{y}}$ are the stepsizes for $\mathbf{x}$ and $\mathbf{y}$ and $\kappa$ is the condition number for $\mathbf{y}$. While this stepsize ratio suggests a slow training of the min player, practical GAN algorithms typically adopt similar stepsizes for both variables, indicating a wide gap between theoretical and empirical results. In this paper, we aim to bridge this gap by analyzing the \emph{local convergence} of general \emph{nonconvex-nonconcave} minimax problems. We demonstrate that a stepsize ratio of $\Theta(\kappa)$ is necessary and sufficient for local convergence of GDA to a Stackelberg Equilibrium, where $\kappa$ is the local condition number for $\mathbf{y}$. We prove a nearly tight convergence rate with a matching lower bound. We further extend the convergence guarantees to stochastic GDA and extra-gradient methods (EG). Finally, we conduct several numerical experiments to support our theoretical findings., Comment: Accepted by ICML 2022

In this paper, we study a linear bandit optimization problem in a federated setting where a large collection of distributed agents collaboratively learn a common linear bandit model. Standard federated learning algorithms applied to this setting are vulnerable to Byzantine attacks on even a small fraction of agents. We propose a novel algorithm with a robust aggregation oracle that utilizes the geometric median. We prove that our proposed algorithm is robust to Byzantine attacks on fewer than half of agents and achieves a sublinear $\tilde{\mathcal{O}}({T^{3/4}})$ regret with $\mathcal{O}(\sqrt{T})$ steps of communication in $T$ steps. Moreover, we make our algorithm differentially private via a tree-based mechanism. Finally, if the level of corruption is known to be small, we show that using the geometric median of mean oracle for robust aggregation further improves the regret bound.

Tidal disruption events (TDEs) occur when a star passes close enough to a galaxy's supermassive black hole to be disrupted by tidal forces. We discuss new observations of IGRJ12580+0134, a TDE observed in NGC 4845 (d=17 Mpc) in November 2010, with the Karl G. Jansky Very Large Array (JVLA). We also discuss a reanalysis of 2010-2011 Swift and XMM-Newton observations, as well as new, late-time Swift observations. Our JVLA observations show a decay of the nuclear radio flux until 2015, when a plateau was seen, and then a significant (~factor 3) radio flare during 2016. The 2016 radio flare was also accompanied by radio spectral changes, but was not seen in the X-rays. We model the flare as resulting from the interaction of the nuclear jet with a cloud in the interstellar medium. This is distinct from late-time X-ray flares in a few other TDEs where changes in the accretion state and/or a fallback event were suggested, neither of which appears possible in this case. Our reanalysis of the Swift and XMM-Newton data from 2011 shows significant evidence for thermal emission from a disk, as well as a very soft power-law. This, in addition to the extreme X-ray flux increase seen in 2010 (a factor of >$100) bolsters the identification of IGRJ12580+0134 as a TDE, not an unusual AGN variability event., Comment: 15 pages, 5 figures. Accepted for publication in ApJ

This work examines the deep disconnect between existing theoretical analyses of gradient-based algorithms and the practice of training deep neural networks. Specifically, we provide numerical evidence that in large-scale neural network training (e.g., ImageNet + ResNet101, and WT103 + TransformerXL models), the neural network's weights do not converge to stationary points where the gradient of the loss is zero. Remarkably, however, we observe that even though the weights do not converge to stationary points, the progress in minimizing the loss function halts and training loss stabilizes. Inspired by this observation, we propose a new perspective based on ergodic theory of dynamical systems to explain it. Rather than studying the evolution of weights, we study the evolution of the distribution of weights. We prove convergence of the distribution of weights to an approximate invariant measure, thereby explaining how the training loss can stabilize without weights necessarily converging to stationary points. We further discuss how this perspective can better align optimization theory with empirical observations in machine learning practice.

Robust laser sources are a fundamental building block for contemporary information technologies. Originating from condensed-matter physics, the concept of topology has recently entered the realm of optics, offering fundamentally new design principles for lasers with enhanced robustness. In analogy to the well-known Majorana fermions in topological superconductors, Dirac-vortex states have recently been investigated in passive photonic systems and are now considered as a promising candidate for single-mode large-area lasers. Here, we experimentally realize the first Dirac-vortex topological lasers in InAs/InGaAs quantum-dot materials monolithically grown on a silicon substrate. We observe room-temperature continuous-wave single-mode linearly polarized vertical laser emission at a telecom wavelength. Most importantly, we confirm that the wavelength of the Dirac-vortex laser is topologically robust against variations in the cavity size, and its free spectral range defies the universal inverse scaling law with the cavity size. These lasers will play an important role in CMOS-compatible photonic and optoelectronic systems on a chip.

We provide a first-order oracle complexity lower bound for finding stationary points of min-max optimization problems where the objective function is smooth, nonconvex in the minimization variable, and strongly concave in the maximization variable. We establish a lower bound of $\Omega\left(\sqrt{\kappa}\epsilon^{-2}\right)$ for deterministic oracles, where $\epsilon$ defines the level of approximate stationarity and $\kappa$ is the condition number. Our analysis shows that the upper bound achieved in (Lin et al., 2020b) is optimal in the $\epsilon$ and $\kappa$ dependence up to logarithmic factors. For stochastic oracles, we provide a lower bound of $\Omega\left(\sqrt{\kappa}\epsilon^{-2} + \kappa^{1/3}\epsilon^{-4}\right)$. It suggests that there is a significant gap between the upper bound $\mathcal{O}(\kappa^3 \epsilon^{-4})$ in (Lin et al., 2020a) and our lower bound in the condition number dependence., Comment: 20 pages, 1 figure

We develop a novel method to simultaneously determine the vertical potential, force and stellar $z-v_z$ phase space distribution function (DF) in our local patch of the Galaxy. We assume that the Solar Neighborhood can be treated as a one-dimensional system in dynamical equilibrium and directly fit the number density in the $z-v_z$ plane to what we call the Rational Linear DF (RLDF) model. This model can be regarded as a continuous sum of isothermal DFs though it has only one more parameter than the isothermal model. We apply our method to a sample of giant stars from Gaia Data Release 2 and show that the RLDF provides an excellent fit to the data. The well-known phase space spiral emerges in the residual map of the $z-v_z$ plane. We use the best-fit potential to plot the residuals in terms of the frequency and angle of vertical oscillations and show that the spiral maps into a straight line. From its slope, we estimate that the phase spirals were generated by a perturbation $\sim540$ Myr years ago. We also determine the differential surface density as a function of vertical velocity dispersion, a.k.a. the vertical temperature distribution. The result is qualitatively similar to what was previously found for SDSS/SEGUE G dwarfs. Finally, we address parameter degeneracies and the validity of the 1D approximation. Particularly, the mid-plane density derived from a cold subsample, where the 1D approximation is more secure, is closer to literature values than that derived from the sample as a whole., Comment: 15 pages, 16 figures

Neural networks are vulnerable to adversarial examples, i.e. inputs that are imperceptibly perturbed from natural data and yet incorrectly classified by the network. Adversarial training, a heuristic form of robust optimization that alternates between minimization and maximization steps, has proven to be among the most successful methods to train networks to be robust against a pre-defined family of perturbations. This paper provides a partial answer to the success of adversarial training, by showing that it converges to a network where the surrogate loss with respect to the the attack algorithm is within $\epsilon$ of the optimal robust loss. Then we show that the optimal robust loss is also close to zero, hence adversarial training finds a robust classifier. The analysis technique leverages recent work on the analysis of neural networks via Neural Tangent Kernel (NTK), combined with motivation from online-learning when the maximization is solved by a heuristic, and the expressiveness of the NTK kernel in the $\ell_\infty$-norm. In addition, we also prove that robust interpolation requires more model capacity, supporting the evidence that adversarial training requires wider networks., Comment: NeurIPS 2019

Gradient descent finds a global minimum in training deep neural networks despite the objective function being non-convex. The current paper proves gradient descent achieves zero training loss in polynomial time for a deep over-parameterized neural network with residual connections (ResNet). Our analysis relies on the particular structure of the Gram matrix induced by the neural network architecture. This structure allows us to show the Gram matrix is stable throughout the training process and this stability implies the global optimality of the gradient descent algorithm. We further extend our analysis to deep residual convolutional neural networks and obtain a similar convergence result., Comment: ICML 2019

In this Letter, we investigate the long-duration quasi-static evolution of 12 pre-eruptive filaments (4 active region and 8 quiescent filaments), mainly focusing on the evolution of the filament height in three dimension (3D) and the decay index of the background magnetic field. The filament height in 3D is derived through two-perspective observations of \textit{Solar Dynamics Observatory} and \textit{Solar TErrestrial RElations Observatory}. The coronal magnetic field is reconstructed using the potential field source surface model. A new finding is that the filaments we studied show two types of long-duration evolution: one type is comprised of a long-duration static phase and a short slow rise phase with a duration of less than 12 hours and a speed of 0.1--0.7 km s$^{-1}$, while the other one only presents a slow rise phase but with an extremely long duration of more than 60 hours and a smaller speed of 0.01--0.2 km s$^{-1}$. At the moment approaching the eruption, the decay index of the background magnetic field at the filament height is similar for both active region and quiescent filaments. The average value and upper limit are $\sim$0.9 and $\sim$1.4, close to the critical index of torus instability. Moreover, the filament height and background magnetic field strength are also found to be linearly and exponentially related with the filament length, respectively., Comment: 6 pages, 4 figures, 1 table, accepted for publication in ApJ Letters

Toward a deeper understanding on the inner work of deep neural networks, we investigate CNN (convolutional neural network) using DCN (deconvolutional network) and randomization technique, and gain new insights for the intrinsic property of this network architecture. For the random representations of an untrained CNN, we train the corresponding DCN to reconstruct the input images. Compared with the image inversion on pre-trained CNN, our training converges faster and the yielding network exhibits higher quality for image reconstruction. It indicates there is rich information encoded in the random features; the pre-trained CNN may discard information irrelevant for classification and encode relevant features in a way favorable for classification but harder for reconstruction. We further explore the property of the overall random CNN-DCN architecture. Surprisingly, images can be inverted with satisfactory quality. Extensive empirical evidence as well as theoretical analysis are provided., Comment: 15 pages, 10 Figures, submitted to a 2018 Conference