Searcharxiv⌕ Search

arXiv subjects

Dong Zheng

Publications and source records attributed to Dong Zheng.

36 records · Page 2Linked to original sources

PrefRec: Recommender Systems with Human Preferences for Reinforcing Long-term User Engagement

Current advances in recommender systems have been remarkably successful in optimizing immediate engagement. However, long-term user engagement, a more desirable performance metric, remains difficult to improve. Meanwhile, recent reinforcement learning (RL) algorithms have shown their effectiveness in a variety of long-term goal optimization tasks. For this reason, RL is widely considered as a promising framework for optimizing long-term user engagement in recommendation. Though promising, the application of RL heavily relies on well-designed rewards, but designing rewards related to long-term user engagement is quite difficult. To mitigate the problem, we propose a novel paradigm, recommender systems with human preferences (or Preference-based Recommender systems), which allows RL recommender systems to learn from preferences about users historical behaviors rather than explicitly defined rewards. Such preferences are easily accessible through techniques such as crowdsourcing, as they do not require any expert knowledge. With PrefRec, we can fully exploit the advantages of RL in optimizing long-term goals, while avoiding complex reward engineering. PrefRec uses the preferences to automatically train a reward function in an end-to-end manner. The reward function is then used to generate learning signals to train the recommendation policy. Furthermore, we design an effective optimization method for PrefRec, which uses an additional value function, expectile regression and reward model pre-training to improve the performance. We conduct experiments on a variety of long-term user engagement optimization tasks. The results show that PrefRec significantly outperforms previous state-of-the-art methods in all the tasks.

cs.IR↗

Three Cases of Optical Periodic Modulation in Active Galactic Nuclei

We report on the case of optical periodic modulation discovered in two Active Galactic Nuclei (AGN) and one candidate AGN. Analyzing the archival optical data obtained from large transient surveys, namely the Catalina Real-Transient Survey (CRTS) and the Zwicky Transient Facility (ZTF), we find periodicities of 2169.7, 2103.1, and 1462.6\,day in sources J0122+1032, J1007+1248 (or PG~1004+1248), and J2131$-$1127, respectively. The optical spectra of the first two indicate that the first is likely a blazar and the second a type 1 Seyfert galaxy, and while no spectroscopic information is available for the third one, its overall properties suggest that it is likely an AGN. In addition, mid-infrared (MIR) light curve data of the three sources, taken by the Wide-field InfraredSurvey Explorer (WISE), are also analyzed. The light curves show significant variations, but not appearing related to the optical periodicities. Based on the widely-discussed super-massive black-hole binary (SMBHB) scenario, we discuss the origin of the optical modulation. Two possible interesting features, an additional 162-day short optical periodicity in J2131$-$1127 and the consistency the X-ray flux variations of J1007+1248 with its optical periodicity, are also discussed within the SMBHB scenario.

astro-ph.GA↗

Cooperative Jamming and Relay Selection for Covert Communications

This paper investigates the covert communications via cooperative jamming and relay selection in a wireless relay system, where a source intends to transmit a message to its destination with the help of a selected relay, and a warden attempts to detect the existence of wireless transmissions from both the source and relay, while friendly jammers send jamming signals to prevent warden from detecting the transmission process. To this end, we first propose two relay selection schemes, namely random relay selection (RRS) and max-min relay selection (MMRS), as well as their corresponding cooperative jamming (CJ) schemes for ensuring covertness in the system. We then provide theoretical modeling for the covert rate performance under each relay selection scheme and its CJ scheme and further explore the optimal transmit power controls of both the source and relay for covert rate maximization. Finally, extensive simulation/numerical results are presented to validate our theoretical models and also to illustrate the covert rate performance of the relay system under cooperative jamming and relay selection.

cs.IT↗

Multi-Task Recommendations with Reinforcement Learning

In recent years, Multi-task Learning (MTL) has yielded immense success in Recommender System (RS) applications. However, current MTL-based recommendation models tend to disregard the session-wise patterns of user-item interactions because they are predominantly constructed based on item-wise datasets. Moreover, balancing multiple objectives has always been a challenge in this field, which is typically avoided via linear estimations in existing works. To address these issues, in this paper, we propose a Reinforcement Learning (RL) enhanced MTL framework, namely RMTL, to combine the losses of different recommendation tasks using dynamic weights. To be specific, the RMTL structure can address the two aforementioned issues by (i) constructing an MTL environment from session-wise interactions and (ii) training multi-task actor-critic network structure, which is compatible with most existing MTL-based recommendation models, and (iii) optimizing and fine-tuning the MTL loss function using the weights generated by critic networks. Experiments on two real-world public datasets demonstrate the effectiveness of RMTL with a higher AUC against state-of-the-art MTL-based recommendation models. Additionally, we evaluate and validate RMTL's compatibility and transferability across various MTL models.

cs.IR↗

On the Gamma-Ray Emission of the Andromeda Galaxy M31

Using the $γ$-ray data obtained with the Large Area Telescope (LAT) onboard {\it the Fermi Gamma-ray Space Telescope (Fermi)} for $\sim$14 years, we examine the high energy emission emanating from the center of the Andromeda Galaxy M31. Different from previously reported results, which show a seemingly extended source, we instead find two individual point sources, one consistent with being at the center and one 0\fdg4 south-east of the center. The emission of the former is well described using a Log-Parabola model, similar to those of previous studies, and that of the latter can be fitted with a power law. We discuss the possible origins for the two sources. M31's central source, now consistent with being a point source, necessitates a revisit of its previously discussed originations with this new property taken into consideration, in particular those cosmic rays or dark matter scenarios involving extended source distributions. The SE source appears to have a projected distance of $\sim$6\,kpc from M31's center, and the investigation is required as to whether it is a source locally associated with M31, or is instead a background extra-galactic one.

astro-ph.HE↗

Reinforcing User Retention in a Billion Scale Short Video Recommender System

Recently, short video platforms have achieved rapid user growth by recommending interesting content to users. The objective of the recommendation is to optimize user retention, thereby driving the growth of DAU (Daily Active Users). Retention is a long-term feedback after multiple interactions of users and the system, and it is hard to decompose retention reward to each item or a list of items. Thus traditional point-wise and list-wise models are not able to optimize retention. In this paper, we choose reinforcement learning methods to optimize the retention as they are designed to maximize the long-term performance. We formulate the problem as an infinite-horizon request-based Markov Decision Process, and our objective is to minimize the accumulated time interval of multiple sessions, which is equal to improving the app open frequency and user retention. However, current reinforcement learning algorithms can not be directly applied in this setting due to uncertainty, bias, and long delay time incurred by the properties of user retention. We propose a novel method, dubbed RLUR, to address the aforementioned challenges. Both offline and live experiments show that RLUR can significantly improve user retention. RLUR has been fully launched in Kuaishou app for a long time, and achieves consistent performance improvement on user retention and DAU.

cs.LG↗

Exploration and Regularization of the Latent Action Space in Recommendation

In recommender systems, reinforcement learning solutions have effectively boosted recommendation performance because of their ability to capture long-term user-system interaction. However, the action space of the recommendation policy is a list of items, which could be extremely large with a dynamic candidate item pool. To overcome this challenge, we propose a hyper-actor and critic learning framework where the policy decomposes the item list generation process into a hyper-action inference step and an effect-action selection step. The first step maps the given state space into a vectorized hyper-action space, and the second step selects the item list based on the hyper-action. In order to regulate the discrepancy between the two action spaces, we design an alignment module along with a kernel mapping function for items to ensure inference accuracy and include a supervision module to stabilize the learning process. We build simulated environments on public datasets and empirically show that our framework is superior in recommendation compared to standard RL baselines.

cs.IR↗

AT2021acak: a candidate tidal disruption event found in the Zwicky Transient Facility survey

We report a candidate tidal disruption event (TDE) found in the Zwicky Transient Facility (ZTF) survey data. This candidate, with its transient name AT2021acak, showed brightness increases of $\sim$1\,mag around MJD~59500 and subsequent power-law--like brightness declines. We have conducted multiple optical spectroscopic observations with the 2.4-m Lijiang telescope and one observation at X-ray and ultraviolet (UV) bands with the {\it Neil Gehrels Swift Observatory (Swift)}. The optical spectra of the source show broad H and He emission line and Fe emission features. Possible 0.3--2\,keV X-ray and bright UV emission of the source was detected. We analyze the declines of the optical light curves, the emission features of the optical spectra, and the constructed broad-band UV and optical spectrum. The properties derived from the analyses are consistent with those of reported (candidate) TDEs, and in particular very similar to those of ASASSN-18jd. The identification is complicated by the host being likely an AGN, and thus further observations of the event and quiescent host are required in order to have a clear understanding of the nature of this transient event.

astro-ph.HE↗

Deconfounding Duration Bias in Watch-time Prediction for Video Recommendation

Watch-time prediction remains to be a key factor in reinforcing user engagement via video recommendations. It has become increasingly important given the ever-growing popularity of online videos. However, prediction of watch time not only depends on the match between the user and the video but is often mislead by the duration of the video itself. With the goal of improving watch time, recommendation is always biased towards videos with long duration. Models trained on this imbalanced data face the risk of bias amplification, which misguides platforms to over-recommend videos with long duration but overlook the underlying user interests. This paper presents the first work to study duration bias in watch-time prediction for video recommendation. We employ a causal graph illuminating that duration is a confounding factor that concurrently affects video exposure and watch-time prediction -- the first effect on video causes the bias issue and should be eliminated, while the second effect on watch time originates from video intrinsic characteristics and should be preserved. To remove the undesired bias but leverage the natural effect, we propose a Duration Deconfounded Quantile-based (D2Q) watch-time prediction framework, which allows for scalability to perform on industry production systems. Through extensive offline evaluation and live experiments, we showcase the effectiveness of this duration-deconfounding framework by significantly outperforming the state-of-the-art baselines. We have fully launched our approach on Kuaishou App, which has substantially improved real-time video consumption due to more accurate watch-time predictions.

cs.IR↗

Constrained Reinforcement Learning for Short Video Recommendation

The wide popularity of short videos on social media poses new opportunities and challenges to optimize recommender systems on the video-sharing platforms. Users provide complex and multi-faceted responses towards recommendations, including watch time and various types of interactions with videos. As a result, established recommendation algorithms that concern a single objective are not adequate to meet this new demand of optimizing comprehensive user experiences. In this paper, we formulate the problem of short video recommendation as a constrained Markov Decision Process (MDP), where platforms want to optimize the main goal of user watch time in long term, with the constraint of accommodating the auxiliary responses of user interactions such as sharing/downloading videos. To solve the constrained MDP, we propose a two-stage reinforcement learning approach based on actor-critic framework. At stage one, we learn individual policies to optimize each auxiliary response. At stage two, we learn a policy to (i) optimize the main response and (ii) stay close to policies learned at the first stage, which effectively guarantees the performance of this main policy on the auxiliaries. Through extensive simulations, we demonstrate effectiveness of our approach over alternatives in both optimizing the main goal as well as balancing the others. We further show the advantage of our approach in live experiments of short video recommendations, where it significantly outperforms other baselines in terms of watch time and interactions from video views. Our approach has been fully launched in the production system to optimize user experiences on the platform.

cs.LG↗

X-ray and Radio Studies of the candidate Millisecond Pulsar Binary 4FGL J0935.3+0901

4FGL J0935.5+0901, a $γ$-ray source recently identified as a candidate redback-type millisecond pulsar binary (MSP), shows an interesting feature of having double-peaked emission lines in its optical spectrum. The feature would further suggest the source as a transitional MSP system in the sub-luminous disk state. We have observed the source with \xmm\ and Five-hundred-meter Aperture Spherical radio Telescope (FAST) at X-ray and radio frequencies respectivelyfor further studies. From the X-ray observation, a bimodal count-rate distribution, which is a distinctive feature of the transitional MSP systems, is not detected, while the properties of X-ray variability and power-law spectrum are determined for the source. These results help establish the consistency of it being a redback in the radio pulsar state. However no radio pulsation signals are found in the FAST observation, resulting an upper limit on the flux density of $\sim 4\,μ$Jy. Implications of these results are discussed.

astro-ph.HE↗

PASTO: Strategic Parameter Optimization in Recommendation Systems -- Probabilistic is Better than Deterministic

Real-world recommendation systems often consist of two phases. In the first phase, multiple predictive models produce the probability of different immediate user actions. In the second phase, these predictions are aggregated according to a set of 'strategic parameters' to meet a diverse set of business goals, such as longer user engagement, higher revenue potential, or more community/network interactions. In addition to building accurate predictive models, it is also crucial to optimize this set of 'strategic parameters' so that primary goals are optimized while secondary guardrails are not hurt. In this setting with multiple and constrained goals, this paper discovers that a probabilistic strategic parameter regime can achieve better value compared to the standard regime of finding a single deterministic parameter. The new probabilistic regime is to learn the best distribution over strategic parameter choices and sample one strategic parameter from the distribution when each user visits the platform. To pursue the optimal probabilistic solution, we formulate the problem into a stochastic compositional optimization problem, in which the unbiased stochastic gradient is unavailable. Our approach is applied in a popular social network platform with hundreds of millions of daily users and achieves +0.22% lift of user engagement in a recommendation task and +1.7% lift in revenue in an advertising optimization scenario comparing to using the best deterministic parameter strategy.

cs.LG↗

Pomeranchuk cooling of the SU($2N$) ultra-cold fermions in optical lattices

We investigate the thermodynamic properties of a half-filled SU(2N) Fermi-Hubbard model in the two-dimensional square lattice using the determinantal quantum Monte Carlo simulation, which is free of the fermion "sign problem". The large number of hyperfine-spin components enhances spin fluctuations, which facilitates the Pomeranchuk cooling to temperatures comparable to the superexchange energy scale at the case of SU$(6)$. Various quantities including entropy, charge fluctuation, and spin correlations have been calculated.

cond-mat.quant-gas↗

Particle-hole symmetry and interaction effects in the Kane-Mele-Hubbard model

We prove that the Kane-Mele-Hubbard model with purely imaginary next-nearest-neighbor hoppings has a particle-hole symmetry at half-filling. Such a symmetry has interesting consequences including the absence of charge and spin currents along open edges, and the absence of the sign problem in the determinant quantum Monte-Carlo simulations. Consequentially, the interplay between band topology and strong correlations can be studied at high numeric precisions. The process that the topological band insulator evolves into the antiferromagnetic Mott insulator as increasing interaction strength is studied by calculating both the bulk and edge electronic properties. In agreement with previous theory analyses, the numeric simulations show that the Kane-Mele-Hubbard model exhibits three phases as increasing correlation effects: the topological band insulating phase with stable helical edges, the bulk paramagnetic phase with unstable edges, and the bulk antiferromagnetic phase.

cond-mat.str-el↗

Continuous quantum phase transition between two topologically distinct valence bond solid states associated with the same spin value

We propose a simple one-dimensional spin-2 Hamiltonian, which exhibits two topologically distinct valence bond solid states in different exactly solvable limits. We then construct the phase diagram and study the quantum phase transition between these states using the infinite time evolving block decimation algorithms. From the scaling relation between the entanglement entropy and correlation length, we find that the central charge for the underlying critical conformal field theory is $c=2$.

cond-mat.str-el↗

Distributed Opportunistic Scheduling With Two-Level Probing

Distributed opportunistic scheduling (DOS) is studied for wireless ad-hoc networks in which many links contend for the channel using random access before data transmissions. Simply put, DOS involves a process of joint channel probing and distributed scheduling for ad-hoc (peer-to-peer) communications. Since, in practice, link conditions are estimated with noisy observations, the transmission rate has to be backed off from the estimated rate to avoid transmission outages. Then, a natural question to ask is whether it is worthwhile for the link with successful contention to perform further channel probing to mitigate estimation errors, at the cost of additional probing. Thus motivated, this work investigates DOS with two-level channel probing by optimizing the tradeoff between the throughput gain from more accurate rate estimation and the resulting additional delay. Capitalizing on optimal stopping theory with incomplete information, we show that the optimal scheduling policy is threshold-based and is characterized by either one or two thresholds, depending on network settings. Necessary and sufficient conditions for both cases are rigorously established. In particular, our analysis reveals that performing second-level channel probing is optimal when the first-level estimated channel condition falls in between the two thresholds. Numerical results are provided to illustrate the effectiveness of the proposed DOS with two-level channel probing. We also extend our study to the case with limited feedback, where the feedback from the receiver to its transmitter takes the form of (0,1,e).

cs.IT↗

Distributed Opportunistic Scheduling for MIMO Ad-Hoc Networks

Distributed opportunistic scheduling (DOS) protocols are proposed for multiple-input multiple-output (MIMO) ad-hoc networks with contention-based medium access. The proposed scheduling protocols distinguish themselves from other existing works by their explicit design for system throughput improvement through exploiting spatial multiplexing and diversity in a {\em distributed} manner. As a result, multiple links can be scheduled to simultaneously transmit over the spatial channels formed by transmit/receiver antennas. Taking into account the tradeoff between feedback requirements and system throughput, we propose and compare protocols with different levels of feedback information. Furthermore, in contrast to the conventional random access protocols that ignore the physical channel conditions of contending links, the proposed protocols implement a pure threshold policy derived from optimal stopping theory, i.e. only links with threshold-exceeding channel conditions are allowed for data transmission. Simulation results confirm that the proposed protocols can achieve impressive throughput performance by exploiting spatial multiplexing and diversity.

cs.IT↗

Distributed Opportunistic Scheduling For Ad-Hoc Communications Under Noisy Channel Estimation

Distributed opportunistic scheduling is studied for wireless ad-hoc networks, where many links contend for one channel using random access. In such networks, distributed opportunistic scheduling (DOS) involves a process of joint channel probing and distributed scheduling. It has been shown that under perfect channel estimation, the optimal DOS for maximizing the network throughput is a pure threshold policy. In this paper, this formalism is generalized to explore DOS under noisy channel estimation, where the transmission rate needs to be backed off from the estimated rate to reduce the outage. It is shown that the optimal scheduling policy remains to be threshold-based, and that the rate threshold turns out to be a function of the variance of the estimation error and be a functional of the backoff rate function. Since the optimal backoff rate is intractable, a suboptimal linear backoff scheme that backs off the estimated signal-to-noise ratio (SNR) and hence the rate is proposed. The corresponding optimal backoff ratio and rate threshold can be obtained via an iterative algorithm. Finally, simulation results are provided to illustrate the tradeoff caused by increasing training time to improve channel estimation at the cost of probing efficiency.

cs.IT↗