Trust snapshot

Quick read

Trust 21 - EmergingVerification L1Unclaimed author
16works
0followers
16topics
4close collaborators

Actions

Decide how to stay connected

Follow researcher0

Identity and collaboration

How to connect with this researcher

Claiming links this public author record to a researcher profile and unlocks direct collaboration workflows.

Log in to claim

Direct collaboration

Open a focused conversation when the fit is right

Claim this author entity first to unlock direct invitations.

Research graph

See the researcher in context

Open full explorer

Inspect adjacent work, topics, institutions and collaborators without jumping out to a separate graph page.

Building this graph slice

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

16 published item(s)

preprint2026arXiv

PRTS: A Primitive Reasoning and Tasking System via Contrastive Representations

Vision-Language-Action (VLA) models advance robotic control via strong visual-linguistic priors. However, existing VLAs predominantly frame pretraining as supervised behavior cloning, overlooking the fundamental nature of robot learning as a goal-reaching process that requires understanding temporal task progress. We present \textbf{PRTS} (\textbf{P}rimitive \textbf{R}easoning and \textbf{T}asking \textbf{S}ystem), a VLA foundation model that reformulates pretraining through Goal-Conditioned Reinforcement Learning. By treating language instructions as goals and employing contrastive reinforcement learning, PRTS learns a unified embedding space where the inner product of state-action and goal embeddings approximates the log-discounted goal occupancy, the probability of reaching the language-specified goal from the current state-action, quantitatively assessing physical feasibility beyond static semantic matching. PRTS draws this dense goal-reachability supervision directly from offline trajectories without reward annotations, and folds it into the VLM backbone via a role-aware causal mask, incurring negligible overhead over vanilla behavior cloning. This paradigm endows the high-level reasoning system with intrinsic goal reachability awareness, bridging semantic reasoning and temporal task progress, and further benefits goal-conditioned action prediction. Pretrained on 167B tokens of diverse manipulation and embodied-reasoning data, PRTS reaches state-of-the-art performance on LIBERO, LIBERO-Pro, LIBERO-Plus, SimplerEnv, and a real-world suite of 14 complex tasks, with particularly substantial gains on long-horizon, contact-rich, and zero-shot novel-instruction settings, confirming that injecting goal-reachability awareness significantly improves both execution success and long-horizon planning of general-purpose robotic foundation policies.

preprint2022arXiv

Automatic Meta-Path Discovery for Effective Graph-Based Recommendation

Heterogeneous Information Networks (HINs) are labeled graphs that depict relationships among different types of entities (e.g., users, movies and directors). For HINs, meta-path-based recommenders (MPRs) utilize meta-paths (i.e., abstract paths consisting of node and link types) to predict user preference, and have attracted a lot of attention due to their explainability and performance. We observe that the performance of MPRs is highly sensitive to the meta-paths they use, but existing works manually select the meta-paths from many possible ones. Thus, to discover effective meta-paths automatically, we propose the Reinforcement learning-based Meta-path Selection (RMS) framework. Specifically, we define a vector encoding for meta-paths and design a policy network to extend meta-paths. The policy network is trained based on the results of downstream recommendation tasks and an early stopping approximation strategy is proposed to speed up training. RMS is a general model, and it can work with all existing MPRs. We also propose a new MPR called RMS-HRec, which uses an attention mechanism to aggregate information from the meta-paths. We conduct extensive experiments on real datasets. Compared with the manually selected meta-paths, the meta-paths identified by RMS consistently improve recommendation quality. Moreover, RMS-HRec outperforms state-of-the-art recommender systems by an average of 7% in hit ratio. The codes and datasets are available on https://github.com/Stevenn9981/RMS-HRec.

preprint2022arXiv

Domain-Adaptive Text Classification with Structured Knowledge from Unlabeled Data

Domain adaptive text classification is a challenging problem for the large-scale pretrained language models because they often require expensive additional labeled data to adapt to new domains. Existing works usually fails to leverage the implicit relationships among words across domains. In this paper, we propose a novel method, called Domain Adaptation with Structured Knowledge (DASK), to enhance domain adaptation by exploiting word-level semantic relationships. DASK first builds a knowledge graph to capture the relationship between pivot terms (domain-independent words) and non-pivot terms in the target domain. Then during training, DASK injects pivot-related knowledge graph information into source domain texts. For the downstream task, these knowledge-injected texts are fed into a BERT variant capable of processing knowledge-injected textual data. Thanks to the knowledge injection, our model learns domain-invariant features for non-pivots according to their relationships with pivots. DASK ensures the pivots to have domain-invariant behaviors by dynamically inferring via the polarity scores of candidate pivots during training with pseudo-labels. We validate DASK on a wide range of cross-domain sentiment classification tasks and observe up to 2.9% absolute performance improvement over baselines for 20 different domain pairs. Code will be made available at https://github.com/hikaru-nara/DASK.

preprint2022arXiv

PreTraM: Self-Supervised Pre-training via Connecting Trajectory and Map

Deep learning has recently achieved significant progress in trajectory forecasting. However, the scarcity of trajectory data inhibits the data-hungry deep-learning models from learning good representations. While mature representation learning methods exist in computer vision and natural language processing, these pre-training methods require large-scale data. It is hard to replicate these approaches in trajectory forecasting due to the lack of adequate trajectory data (e.g., 34K samples in the nuScenes dataset). To work around the scarcity of trajectory data, we resort to another data modality closely related to trajectories-HD-maps, which is abundantly provided in existing datasets. In this paper, we propose PreTraM, a self-supervised pre-training scheme via connecting trajectories and maps for trajectory forecasting. Specifically, PreTraM consists of two parts: 1) Trajectory-Map Contrastive Learning, where we project trajectories and maps to a shared embedding space with cross-modal contrastive learning, and 2) Map Contrastive Learning, where we enhance map representation with contrastive learning on large quantities of HD-maps. On top of popular baselines such as AgentFormer and Trajectron++, PreTraM boosts their performance by 5.5% and 6.9% relatively in FDE-10 on the challenging nuScenes dataset. We show that PreTraM improves data efficiency and scales well with model size.

preprint2022arXiv

Private Adaptive Optimization with Side Information

Adaptive optimization methods have become the default solvers for many machine learning tasks. Unfortunately, the benefits of adaptivity may degrade when training with differential privacy, as the noise added to ensure privacy reduces the effectiveness of the adaptive preconditioner. To this end, we propose AdaDPS, a general framework that uses non-sensitive side information to precondition the gradients, allowing the effective use of adaptive methods in private settings. We formally show AdaDPS reduces the amount of noise needed to achieve similar privacy guarantees, thereby improving optimization performance. Empirically, we leverage simple and readily available side information to explore the performance of AdaDPS in practice, comparing to strong baselines in both centralized and federated settings. Our results show that AdaDPS improves accuracy by 7.7% (absolute) on average -- yielding state-of-the-art privacy-utility trade-offs on large-scale text and image benchmarks.

preprint2021arXiv

CoDeNet: Efficient Deployment of Input-Adaptive Object Detection on Embedded FPGAs

Deploying deep learning models on embedded systems has been challenging due to limited computing resources. The majority of existing work focuses on accelerating image classification, while other fundamental vision problems, such as object detection, have not been adequately addressed. Compared with image classification, detection problems are more sensitive to the spatial variance of objects, and therefore, require specialized convolutions to aggregate spatial information. To address this need, recent work introduces dynamic deformable convolution to augment regular convolutions. However, this will lead to inefficient memory accesses of inputs with existing hardware. In this work, we harness the flexibility of FPGAs to develop a novel object detection pipeline with deformable convolutions. We show the speed-accuracy tradeoffs for a set of algorithm modifications including irregular-access versus limited-range and fixed-shape. We then Co-Design a Network CoDeNet with the modified deformable convolution and quantize it to 4-bit weights and 8-bit activations. With our high-efficiency implementation, our solution reaches 26.9 frames per second with a tiny model size of 0.76 MB while achieving 61.7 AP50 on the standard object detection dataset, Pascal VOC. With our higher accuracy implementation, our model gets to 67.1 AP50 on Pascal VOC with only 2.9 MB of parameters-20.9x smaller but 10% more accurate than Tiny-YOLO.

preprint2021arXiv

Efficient all-optical helicity dependent switching of spins in a Pt/Co/Pt film by a dual-pulse excitation

All-optical helicity dependent switching (AO-HDS), deterministic control of magnetization by circularly polarized laser pulses, allows to efficiently manipulate spins without the need of a magnetic field. However, AO-HDS in ferromagnetic metals so far requires many laser pulses for fully switching their magnetic states. Using a combination of a short, 90-fs linearly polarized pulse and a subsequent longer, 3-ps circularly polarized pulse, we demonstrate that the number of pulses for full magnetization reversal can be reduced to 4 pulse pairs in a single stack of Pt/Co/Pt. The obtained results suggest that the dual-pulse approach is a potential route towards realizing efficient AO-HDS in ferromagnetic metals.

preprint2020arXiv

Fair Resource Allocation in Federated Learning

Federated learning involves training statistical models in massive, heterogeneous networks. Naively minimizing an aggregate loss function in such a network may disproportionately advantage or disadvantage some of the devices. In this work, we propose q-Fair Federated Learning (q-FFL), a novel optimization objective inspired by fair resource allocation in wireless networks that encourages a more fair (specifically, a more uniform) accuracy distribution across devices in federated networks. To solve q-FFL, we devise a communication-efficient method, q-FedAvg, that is suited to federated networks. We validate both the effectiveness of q-FFL and the efficiency of q-FedAvg on a suite of federated datasets with both convex and non-convex models, and show that q-FFL (along with q-FedAvg) outperforms existing baselines in terms of the resulting fairness, flexibility, and efficiency.

preprint2020arXiv

FedDANE: A Federated Newton-Type Method

Federated learning aims to jointly learn statistical models over massively distributed remote devices. In this work, we propose FedDANE, an optimization method that we adapt from DANE, a method for classical distributed optimization, to handle the practical constraints of federated learning. We provide convergence guarantees for this method when learning over both convex and non-convex functions. Despite encouraging theoretical results, we find that the method has underwhelming performance empirically. In particular, through empirical simulations on both synthetic and real-world datasets, FedDANE consistently underperforms baselines of FedAvg and FedProx in realistic federated settings. We identify low device participation and statistical device heterogeneity as two underlying causes of this underwhelming performance, and conclude by suggesting several directions of future work.

preprint2020arXiv

Federated Optimization in Heterogeneous Networks

Federated Learning is a distributed learning paradigm with two key challenges that differentiate it from traditional distributed optimization: (1) significant variability in terms of the systems characteristics on each device in the network (systems heterogeneity), and (2) non-identically distributed data across the network (statistical heterogeneity). In this work, we introduce a framework, FedProx, to tackle heterogeneity in federated networks. FedProx can be viewed as a generalization and re-parametrization of FedAvg, the current state-of-the-art method for federated learning. While this re-parameterization makes only minor modifications to the method itself, these modifications have important ramifications both in theory and in practice. Theoretically, we provide convergence guarantees for our framework when learning over data from non-identical distributions (statistical heterogeneity), and while adhering to device-level systems constraints by allowing each participating device to perform a variable amount of work (systems heterogeneity). Practically, we demonstrate that FedProx allows for more robust convergence than FedAvg across a suite of realistic federated datasets. In particular, in highly heterogeneous settings, FedProx demonstrates significantly more stable and accurate convergence behavior relative to FedAvg---improving absolute test accuracy by 22% on average.

preprint2020arXiv

Outage Behaviors of NOMA-based Satellite Network over Shadowed-Rician Fading Channels

This paper investigates the application of non-orthogonal multiple access (NOMA) to satellite communication network over Shadowed-Rician fading channels. The impact of imperfect successive interference cancellation (ipSIC) on NOMA-based satellite network is taken into consideration from the perspective of practical scenarios. We first derive new exact expressions of outage probability for the p-th terrestrial user and provide the corresponding asymptotic analysis results. The diversity order of zero and p are achieved by the p-th terrestrial user with ipSIC and perfect successive interference cancellation (pSIC), respectively. Finally, the presented simulation results show that: 1) On the condition of pSIC, the outage behaviors of NOMA-based satellite network are superior to that of orthogonal multiple access; 2) With the value of residual interference increasing, the outage performance of terrestrial users with ipSIC is becoming worse seriously; and 3) Infrequent light shadowing of Shadowed-Rician fading brings the better outage probability compared to frequent heavy and average shadowing.

preprint2020arXiv

Squeezed Light Induced Two-photon Absorption Fluorescence of Fluorescein Biomarkers

Two-photon absorption (TPA) fluorescence of biomarkers has been decisive in advancing the fields of biosensing and deep-tissue in vivo imaging of live specimens. However, due to the extremely small TPA cross section and the quadratic dependence on the input photon flux, extremely high peak-intensity pulsed lasers are imperative, which can result in significant photo- and thermal-damage. Previous works on entangled TPA (ETPA) with spontaneous parametric down-conversion (SPDC) light sources found a linear dependence on the input photon-pair flux, but are limited by low optical powers, along with a very broad spectrum. We report that by using a high-flux squeezed light source for TPA, a fluorescence enhancement of 47 is achieved in fluorescein biomarkers as compared to classical TPA. Moreover, a polynomial behavior of the TPA rate is observed in the DCM laser dye.

preprint2019arXiv

Federated Learning: Challenges, Methods, and Future Directions

Federated learning involves training statistical models over remote devices or siloed data centers, such as mobile phones or hospitals, while keeping data localized. Training in heterogeneous and potentially massive networks introduces novel challenges that require a fundamental departure from standard approaches for large-scale machine learning, distributed optimization, and privacy-preserving data analysis. In this article, we discuss the unique characteristics and challenges of federated learning, provide a broad overview of current approaches, and outline several directions of future work that are relevant to a wide range of research communities.

preprint2018arXiv

Magnetotransport in phase-separated (Ga,Fe)N with $γ$'-Ga$_y$Fe$_{4-y}$N nanocrystals

The magnetotransport in phase-separated (Ga,Fe)N containing $γ$&#39;-Ga$_y$Fe$_{4-y}$N (0\,$<$\,y\,$<$1) nanocrystals (NCs) is studied in the temperature range between 2\,K and 300\,K. The evolution of the resistivity and of the magnetoresistance (MR) as a function of temperature points at two conduction mechanisms: namely a conventional Arrhenius-type one down to 50\,K, and Mott variable range hopping at lower temperatures, where the spin-polarized current is transported between NCs in a regime in which phonon-scattering effects are not dominant. Below 25\,K, the MR shows a hysteretic contribution at magnetic fields $<$1\,T and proportional to the coercive field. Anisotropic magnetoresistance with values one order of magnitude greater than those previously reported for $γ$&#39;-Fe$_4$N thin films over the whole considered temperature range, confirms that the observed MR in these layers is determined by the embedded nanocrystals.

preprint2014arXiv

Quantum mutual information of an entangled state propagating through a fast-light medium

Although it is widely accepted that classical information cannot travel faster than the speed of light in vacuum, the behavior of quantum correlations and quantum information propagating through actively-pumped fast-light media has not been studied in detail. To investigate this behavior, we send one half of an entangled state of light through a gain-assisted fast-light medium and detect the remaining quantum correlations. We show that the quantum correlations can be advanced by a small fraction of the correlation time while the entanglement is preserved even in the presence of noise added by phase-insensitive gain. Additionally, although we observe an advance of the peak of the quantum mutual information between the modes, we find that the degradation of the mutual information due to the added noise appears to prevent an advancement of the leading edge. In contrast, we show that both the leading and trailing edges of the mutual information in a slow-light system can be significantly delayed.

preprint2013arXiv

Advanced Quantum Noise

We use the quantum correlations of twin-beams of light to probe the added noise when one of the beams propagates through a medium with anomalous dispersion. The experiment is based on two successive four-wave mixing processes in rubidium vapor, which allow for the generation of bright two-mode-squeezed twin-beams followed by a controlled advancement while maintaining the shared quantum-correlations between the beams. The demonstrated effect allows the study of irreversible decoherence in a medium exhibiting anomalous dispersion, and for the first time shows the advancement of a bright nonclassical state of light. The advancement and corresponding degradation of the quantum correlations are found to be operating near the fundamental quantum limit imposed by using a phase-insensitive amplifier.