arXiv subjects

Yuchen He

Publications and source records attributed to Yuchen He.

At least 55 records · Page 3Linked to original sources

arXiv2024

GPT-4 Technical Report

We report the development of GPT-4, a large-scale, multimodal model which can accept image and text inputs and produce text outputs. While less capable than humans in many real-world scenarios, GPT-4 exhibits human-level performance on various professional and academic benchmarks, including passing a simulated bar exam with a score around the top 10% of test takers. GPT-4 is a Transformer-based model pre-trained to predict the next token in a document. The post-training alignment process results in improved performance on measures of factuality and adherence to desired behavior. A core component of this project was developing infrastructure and optimization methods that behave predictably across a wide range of scales. This allowed us to accurately predict some aspects of GPT-4's performance based on models trained with no more than 1/1,000th the compute of GPT-4.

cs.CL↗

arXiv2024

ViSTec: Video Modeling for Sports Technique Recognition and Tactical Analysis

The immense popularity of racket sports has fueled substantial demand in tactical analysis with broadcast videos. However, existing manual methods require laborious annotation, and recent attempts leveraging video perception models are limited to low-level annotations like ball trajectories, overlooking tactics that necessitate an understanding of stroke techniques. State-of-the-art action segmentation models also struggle with technique recognition due to frequent occlusions and motion-induced blurring in racket sports videos. To address these challenges, We propose ViSTec, a Video-based Sports Technique recognition model inspired by human cognition that synergizes sparse visual data with rich contextual insights. Our approach integrates a graph to explicitly model strategic knowledge in stroke sequences and enhance technique recognition with contextual inductive bias. A two-stage action perception model is jointly trained to align with the contextual knowledge in the graph. Experiments demonstrate that our method outperforms existing models by a significant margin. Case studies with experts from the Chinese national table tennis team validate our model's capacity to automate analysis for technical actions and tactical strategies. More details are available at: https://ViSTec2024.github.io/.

cs.CV↗

arXiv2023

Improved Algorithms for Bandit with Graph Feedback via Regret Decomposition

The problem of bandit with graph feedback generalizes both the multi-armed bandit (MAB) problem and the learning with expert advice problem by encoding in a directed graph how the loss vector can be observed in each round of the game. The mini-max regret is closely related to the structure of the feedback graph and their connection is far from being fully understood. We propose a new algorithmic framework for the problem based on a partition of the feedback graph. Our analysis reveals the interplay between various parts of the graph by decomposing the regret to the sum of the regret caused by small parts and the regret caused by their interaction. As a result, our algorithm can be viewed as an interpolation and generalization of the optimal algorithms for MAB and learning with expert advice. Our framework unifies previous algorithms for both strongly observable graphs and weakly observable graphs, resulting in improved and optimal regret bounds on a wide range of graph families including graphs of bounded degree and strongly observable graphs with a few corrupted arms.

cs.LG↗

arXiv2023

On Interpolating Experts and Multi-Armed Bandits

Learning with expert advice and multi-armed bandit are two classic online decision problems which differ on how the information is observed in each round of the game. We study a family of problems interpolating the two. For a vector $\mathbf{m}=(m_1,\dots,m_K)\in \mathbb{N}^K$, an instance of $\mathbf{m}$-MAB indicates that the arms are partitioned into $K$ groups and the $i$-th group contains $m_i$ arms. Once an arm is pulled, the losses of all arms in the same group are observed. We prove tight minimax regret bounds for $\mathbf{m}$-MAB and design an optimal PAC algorithm for its pure exploration version, $\mathbf{m}$-BAI, where the goal is to identify the arm with minimum loss with as few rounds as possible. We show that the minimax regret of $\mathbf{m}$-MAB is $Θ\left(\sqrt{T\sum_{k=1}^K\log (m_k+1)}\right)$ and the minimum number of pulls for an $(ε,0.05)$-PAC algorithm of $\mathbf{m}$-BAI is $Θ\left(\frac{1}{ε^2}\cdot \sum_{k=1}^K\log (m_k+1)\right)$. Both our upper bounds and lower bounds for $\mathbf{m}$-MAB can be extended to a more general setting, namely the bandit with graph feedback, in terms of the clique cover and related graph parameters. As consequences, we obtained tight minimax regret bounds for several families of feedback graphs.

cs.LG↗

arXiv2023

Optimizing Long-term Value for Auction-Based Recommender Systems via On-Policy Reinforcement Learning

Auction-based recommender systems are prevalent in online advertising platforms, but they are typically optimized to allocate recommendation slots based on immediate expected return metrics, neglecting the downstream effects of recommendations on user behavior. In this study, we employ reinforcement learning to optimize for long-term return metrics in an auction-based recommender system. Utilizing temporal difference learning, a fundamental reinforcement learning algorithm, we implement an one-step policy improvement approach that biases the system towards recommendations with higher long-term user engagement metrics. This optimizes value over long horizons while maintaining compatibility with the auction framework. Our approach is grounded in dynamic programming ideas which show that our method provably improves upon the existing auction-based base policy. Through an online A/B test conducted on an auction-based recommender system which handles billions of impressions and users daily, we empirically establish that our proposed method outperforms the current production system in terms of long-term user engagement metrics.

cs.IR↗

arXiv2023

Group projected Subspace Pursuit for Identification of variable coefficient differential equations (GP-IDENT)

We propose an effective and robust algorithm for identifying partial differential equations (PDEs) with space-time varying coefficients from a single trajectory of noisy observations. Identifying unknown differential equations from noisy observations is a difficult task, and it is even more challenging with space and time varying coefficients in the PDE. The proposed algorithm, GP-IDENT, has three ingredients: (i) we use B-spline bases to express the unknown space and time varying coefficients, (ii) we propose Group Projected Subspace Pursuit (GPSP) to find a sequence of candidate PDEs with various levels of complexity, and (iii) we propose a new criterion for model selection using the Reduction in Residual (RR) to choose an optimal one among the pool of candidates. The new GPSP considers group projected subspaces which is more robust than existing methods in distinguishing correlated group features. We test GP-IDENT on a variety of PDEs and PDE systems, and compare it with the state-of-the-art parametric PDE identification algorithms under different settings to illustrate its outstanding performance. Our experiments show that GP-IDENT is effective in identifying the correct terms from a large dictionary and the model selection scheme is robust to noise.

math.NA↗

arXiv2023

Robust Identification of Differential Equations by Numerical Techniques from a Single Set of Noisy Observation

We propose robust methods to identify underlying Partial Differential Equation (PDE) from a given set of noisy time dependent data. We assume that the governing equation is a linear combination of a few linear and nonlinear differential terms in a prescribed dictionary. Noisy data make such identification particularly challenging. Our objective is to develop methods which are robust against a high level of noise, and to approximate the underlying noise-free dynamics well. We first introduce a Successively Denoised Differentiation (SDD) scheme to stabilize the amplified noise in numerical differentiation. SDD effectively denoises the given data and the corresponding derivatives. Secondly, we present two algorithms for PDE identification: Subspace pursuit Time evolution error (ST) and Subspace pursuit Cross-validation (SC). Our general strategy is to first find a candidate set using the Subspace Pursuit (SP) greedy algorithm, then choose the best one via time evolution or cross validation. ST uses multi-shooting numerical time evolution and selects the PDE which yields the least evolution error. SC evaluates the cross-validation error in the least squares fitting and picks the PDE that gives the smallest validation error. We present a unified notion of PDE identification error to compare the objectives of related approaches. We present various numerical experiments to validate our methods. Both methods are efficient and robust to noise.

math.NA↗

arXiv2023

NASRec: Weight Sharing Neural Architecture Search for Recommender Systems

The rise of deep neural networks offers new opportunities in optimizing recommender systems. However, optimizing recommender systems using deep neural networks requires delicate architecture fabrication. We propose NASRec, a paradigm that trains a single supernet and efficiently produces abundant models/sub-architectures by weight sharing. To overcome the data multi-modality and architecture heterogeneity challenges in the recommendation domain, NASRec establishes a large supernet (i.e., search space) to search the full architectures. The supernet incorporates versatile choice of operators and dense connectivity to minimize human efforts for finding priors. The scale and heterogeneity in NASRec impose several challenges, such as training inefficiency, operator-imbalance, and degraded rank correlation. We tackle these challenges by proposing single-operator any-connection sampling, operator-balancing interaction modules, and post-training fine-tuning. Our crafted models, NASRecNet, show promising results on three Click-Through Rates (CTR) prediction benchmarks, indicating that NASRec outperforms both manually designed models and existing NAS methods with state-of-the-art performance. Our work is publicly available at https://github.com/facebookresearch/NasRec.

cs.IR↗

arXiv2022

How much can one learn a partial differential equation from its solution?

In this work we study the problem about learning a partial differential equation (PDE) from its solution data. PDEs of various types are used as examples to illustrate how much the solution data can reveal the PDE operator depending on the underlying operator and initial data. A data driven and data adaptive approach based on local regression and global consistency is proposed for stable PDE identification. Numerical experiments are provided to verify our analysis and demonstrate the performance of the proposed algorithms.

math.NA↗

arXiv2022

Non-invasive color imaging through scattering medium under broadband illumination

Due to the complex of mixed spectral point spread function within memory effect range, it is unreliable and slow to use speckle correlation technology for non-invasive imaging through scattering medium under broadband illumination. The contrast of the speckles will drastically drop as the light source's spectrum width increases. Here, we propose a method for producing the optical transfer function with several speckle frames within memory effect range to image under broadband illumination. The method can be applied to image amplitude and color objects under white LED illumination. Compared to other approaches of imaging under broadband illumination, such as deep learning and modified phase retrieval, our method can provide more stable results with faster convergence speed, which can be applied in high speed scattering imaging under natural light illumination.

physics.optics↗

arXiv2022

Numerical Identification of Nonlocal Potential in Aggregation

Aggregation equations are broadly used to model population dynamics with nonlocal interactions, characterized by a potential in the equation. This paper considers the inverse problem of identifying the potential from a single noisy spatial-temporal process. The identification is challenging in the presence of noise due to the instability of numerical differentiation. We propose a robust model-based technique to identify the potential by minimizing a regularized data fidelity term, and regularization is taken as the total variation and the squared Laplacian. A split Bregman method is used to solve the regularized optimization problem. Our method is robust to noise by utilizing a Successively Denoised Differentiation technique. We consider additional constraints such as compact support and symmetry constraints to enhance the performance further. We also apply this method to identify time-varying potentials and identify the interaction kernel in an agent-based system. Various numerical examples in one and two dimensions are included to verify the effectiveness and robustness of the proposed method.

math.NA↗

arXiv2022

Extreme wave excitation from localized phase-shift perturbations

The modulation instability is a focusing mechanism responsible for the formation of strong wave localizations not only on the water surface, but also in a variety of nonlinear dispersive media. Such dynamics is initiated from the injection of side-bands, which translate into an amplitude modulation of the wave field. The nonlinear stage of unstable wave evolution can be described by exact solutions of the nonlinear Schrödinger equation (NLSE). In that case, the amplitude modulation of such coherent extreme wave structures is connected to a particular phase-shift seed in the carrier wave. In this letter, we show that phase-shifts localization applied to the background, excluding any amplitude modulation excitation, can indeed trigger extreme events. Such rogue waves can be for instance generated by considering the parametrization of fundamental breathers and thus, by seeding only the local phase-shift information to the regular carrier wave. Our wave tank experiments show an excellent agreement with the expected NLSE hydrodynamics and confirm that even though delayed in their evolution, breather-type extreme waves can be generated from a purely regular wave train. Such novel focusing mechanism awaits experimental confirmation in other nonlinear media, such optics, plasma, and Bose-Einstein condensates.

physics.flu-dyn↗

arXiv2022

Experimental evidence of nonlinear focusing in standing water waves

Nonlinear wave focusing originating from the universal modulation instability (MI) is responsible for the formation of strong wave localizations on the water surface and in nonlinear wave guides, such as optical Kerr media and plasma. Such extreme wave dynamics can be described by breather solutions of the nonlinear Schrödinger equation (NLSE) like by way of example the famed doubly-localized Peregrine breathers (PB), which typify particular cases of MI. On the other hand, it has been suggested that the MI relevance weakens when the wave field becomes broadband or directional. Here, we provide experimental evidence of nonlinear and distinct PB-type focusing in standing water waves describing the scenario of two counter-propagating wave trains. The collected collinear wave measurements are in excellent agreement with the hydrodynamic coupled NLSE (CNLSE) and suggest that MI can undisturbedly prevail during the interplay of several wave systems and emphasize the potential role of exact NLSE solutions in extreme wave formation beyond the formal narrowband and uni-directional limits. Our work may inspire further experimental investigations in various nonlinear wave guides governed by CNLSE frameworks as well as theoretical progress to predict strong wave coherence in directional fields.

physics.flu-dyn↗

arXiv2022

Galilean-transformed solitons and supercontinuum generation in dispersive media

The Galilean transformation is a universal operation connecting the coordinates of a dynamical system, which move relative to each other with a constant speed. In the context of exact solutions of the universal nonlinear Schrödinger equation (NLSE), inducing a Galilean velocity (GV) to the pulse involves a frequency shift to satisfy the symmetry of the wave equation. As such, the Galilean transformation has been deemed to be not applicable to wave groups in nonlinear dispersive media. In this paper, we demonstrate that in a wave tank generated Galilean transformed envelope and Peregrine solitons show clear variations from their respective pure dynamics on the water surface. The type of deviations depends on the sign of the GV and can be captured by the modified NLSE or the Euler equations. Moreover, we show that positive Galilean-translated envelope soliton pulses exhibit self-modulation. While designated GS and wave steepness values expedite multi-soliton dynamics, the strong focusing of such higher-order coherent waves inevitably lead to the generation of supercontinua as a result of soliton fission. We anticipate that kindred experimental and numerical studies might be implemented in other dispersive wave guides governed by nonlinearity.

nlin.PS↗

arXiv2021

Nth-order nonlinear intensity fluctuation amplifier

Stronger light intensity fluctuations are pursued by related applications such as optical resolution, image enhancement, and beam positioning. In this paper, an Nth-order light intensity fluctuation amplifier is proposed, which was demonstrated by a four-wave mixing process with different statistical distribution coupling lights. Firstly, its amplification mechanism is revealed both theoretically and experimentally. The ratio $R$ of statistical distributions and the degree of second-order coherence ${g^{(2)}}(0)$ of beams are used to characterize the affected modulations and the increased light intensity fluctuations through the four-wave mixing process. The results show that the amplification of light intensity fluctuations is caused by not only the fluctuating light fields of incident coupling beams, but also the fluctuating nonlinear coefficient of interaction. At last, we highlight the potentiality of applying such amplifier to other N-order nonlinear optical effects.

physics.optics↗

arXiv2021

Ghost Imaging Based on Recurrent Neural Network

Benefit from the promising features of second-order correlation, ghost imaging (GI) has received extensive attentions in recent years. Simultaneously, GI is affected by the poor trade-off between sampling rate and imaging quality. The traditional image reconstruction method in GI is to accumulate the action result of each speckle and the corresponding bucket signal. We found that the image reconstruction process of GI is very similar to the Recurrent Neural Network (RNN), which is one of the deep learning algorithm. In this paper, we proposed a novel method that effectively implements GI on the RNN architecture, called GI-RNN. The state of each layer in RNN is determined by the output of the previous layer and the input of this layer, and the output of the network is the sum of all previous states. Therefore, we take the speckle of each illumination and the corresponding bucket signal as the input of each layer, and the output of the network is the sum of all previous speckle and bucket signal, which is the image of the target. The testing results show that the proposed method can achieve image reconstruction at a very low sampling rate (0.38$\%$). Moreover, we compare GI-RNN with traditional GI algorithm and compressed sensing algorithm. The results of different targets show that GI-RNN is 6.61 dB higher than compressed sensing algorithm and 12.58 dB higher than traditional GI algorithm on average. In our view, the proposed method makes an important step to applications of GI.

eess.IV↗

arXiv2021

Multi-tasking Dialogue Comprehension with Discourse Parsing

Multi-party dialogue machine reading comprehension (MRC) raises an even more challenging understanding goal on dialogue with more than two involved speakers, compared with the traditional plain passage style MRC. To accurately perform the question-answering (QA) task according to such multi-party dialogue, models have to handle fundamentally different discourse relationships from common non-dialogue plain text, where discourse relations are supposed to connect two far apart utterances in a linguistics-motivated way.To further explore the role of such unusual discourse structure on the correlated QA task in terms of MRC, we propose the first multi-task model for jointly performing QA and discourse parsing (DP) on the multi-party dialogue MRC task. Our proposed model is evaluated on the latest benchmark Molweni, whose results indicate that training with complementary tasks indeed benefits not only QA task, but also DP task itself. We further find that the joint model is distinctly stronger when handling longer dialogues which again verifies the necessity of DP in the related MRC.

cs.CL↗

arXiv2021

Learning Friction Model for Magnet-actuated Tethered Capsule Robot

The potential diagnostic applications of magnet-actuated capsules have been greatly increased in recent years. For most of these potential applications, accurate position control of the capsule have been highly demanding. However, the friction between the robot and the environment as well as the drag force from the tether play a significant role during the motion control of the capsule. Moreover, these forces especially the friction force are typically hard to model beforehand. In this paper, we first designed a magnet-actuated tethered capsule robot, where the driving magnet is mounted on the end of a robotic arm. Then, we proposed a learning-based approach to model the friction force between the capsule and the environment, with the goal of increasing the control accuracy of the whole system. Finally, several real robot experiments are demonstrated to showcase the effectiveness of our proposed approach.

cs.RO↗