Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Jinghai He

dblp:314/9142 · DBLP profile ↗
← Back
5ranked-venue papers
0as first author
5since 2021 · last 2024
0000-0002-5458-2048ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 2 since 2021Databases, data management, data science and information retrieval · 2 · 2 since 2021Computer networks · 1 · 1 since 2021Human-computer interaction and ubiquitous computing · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
2 papers
Reinforcement learning · 72% Learning theory · 22% Probabilistic and Bayesian machine learning · 6%
Computer graphics and multimedia
1 paper
Image and video processing · 100%
Human-computer interaction and pervasive computing
1 paper
Personal fabrication and tangible interfaces · 77% Immersive interaction · 23%

Topics — the 8 heaviest of 11, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning › bandit
contextual bandit
0.712023
Contextual Gaussian Process Bandits with Neural Networks · NeurIPS 2023
Machine learning › Reinforcement learning › bandit › non-parametric bandit
gaussian process bandits
0.712023
Contextual Gaussian Process Bandits with Neural Networks · NeurIPS 2023
Machine learning › Reinforcement learning
multi-armed bandit
0.712023
2nd Workshop on Multi-Armed Bandits and Reinforcement Learning: Advancing Decision Making in E-Commerce and Beyond · KDD 2023
Machine learning › Learning theory › online learning
regret bounds
0.712023
Contextual Gaussian Process Bandits with Neural Networks · NeurIPS 2023
Image and video processing › image restoration › artifact removal
demoiréing
0.712023
Effectively Learning Moiré QR Code Decryption from Simulated Data · INFOCOM 2023
Image and video processing
image restoration
0.712023
Effectively Learning Moiré QR Code Decryption from Simulated Data · INFOCOM 2023
Machine learning › Probabilistic and Bayesian machine learning › stochastic processes
gaussian process
0.212023
Contextual Gaussian Process Bandits with Neural Networks · NeurIPS 2023
Immersive interaction
mixed reality
0.212023
4Doodle: 4D Printing Artifacts Without 3D Printers · CHI 2023

Methods — techniques the papers use, named apart from their topics

user study · 0.7simulated data training · 0.7neural network · 0.7mixed reality system · 0.7information gain analysis · 0.7gaussian process · 0.7
YearPublicationVenuePosition
2024 Meta-Adaptive Stock Movement Prediction with Two-Stage Representation Learning
abstract
Stock movement prediction has always been a tough but attractive task for researchers in data mining and machine learning. Generally speaking, two challenges for stock time series prediction remain not well-explored. One is the over-fitting of deep learning models due to the limited data availability. The second one is potential domain shifts that may happen during the evolution of the stock time series. In this paper, we present Meta-Adaptive Stock movement prediction with two-StagE Representation learning (MASSER), a framework for stock movement prediction based on self-supervised learning and meta-learning. Specifically, we first design two-stage encoders to learn representations, the first-stage encoder aims to learn unified embeddings, and the second-stage encoder, which is based on the first stage, is used for temporal domain shift detection in the training stage via self-supervised learning. We formalize the problem of stock movement prediction into a standard meta-learning setting. Inspired by importance sampling, we estimate the sampling probability for tasks to balance the domain discrepancy caused by evolving temporal domains. Extensive experiment results on two open source datasets show that our experimental framework with the classical ResNet as backbone achieves improvements of 5% - 9.5% on average accuracy, compared to state-of-the-art baselines. Furthermore, We extend the standard setting of stock movement prediction to a more challenging online paradigm, which is close to the realistic interday trading scenarios. MASSER outperforms baselines in both online setting and backtesting.
Donglin Zhan, Yusheng Dai, Jinghai He, Zhenyi Wang 0001, James Anderson 0001
SDM4
2023 4Doodle: 4D Printing Artifacts Without 3D Printers
abstract
4D printing encodes transformability over time, which empowers users to create artifacts by on-demand deformation. The creative process of 4D printing shape-changing artifacts can be challenging because of its discontinuous fabrication steps, such as digital designing, specific path planning, automatic printing and manual triggering. We hypothesize that switching from typical 4D printing reliant on 3D printers to a more “handcrafted” method can allow users to understand and continuously reflect upon the artifact and its transformability. Towards this vision, we introduce 4Doodle, a hybrid craft approach that integrates unique deformation controllability and five techniques for freehand 4D printing, using a 3D pen. To tackle the shape-changing challenges of uncertain hands-on fabrication, we develop a mixed reality system to help novices master the manual skills of 4D printing. We also demonstrate a series of 4D printed artifacts with fully human intervention. Finally, our user study shows that 4Doodle lowers the skill-acquisition barrier associated with handcrafting 4D printed artifacts, and it has great potential for creative production and spatial ability.
Ye Tao 0001, Junzhe Ji, Linlin Cai, Hongmei Xia, Jinghai He, Yitao Fan, Shengzhang Pan, Jinghua Xu, Cheng Yang 0014, Lingyun Sun, Guanyun Wang
CHI7
2023 Effectively Learning Moiré QR Code Decryption from Simulated Data
Yu Lu 0022, Hao Pan 0003, Feitong Tan, Yi-Chao Chen 0001, Jiadi Yu, Jinghai He, Guangtao Xue
INFOCOM6
2023 2nd Workshop on Multi-Armed Bandits and Reinforcement Learning: Advancing Decision Making in E-Commerce and Beyond
abstract
The areas of reinforcement learning and multi-armed bandits have recently seen significant innovation, while many application domains, such as e-commerce, are full of problems and challenges to which vanilla RL or MAB methods cannot directly apply. This workshop aims at filling this communication gap by creating a platform for researchers and practitioners from both the method/theory side and application side of the community. Having this platform now instead of at a later time is beneficial to all sides of the community: practitioners and frontline scientists are able to avoid re-inventing existing techniques; theory-oriented researchers can find motivation in industry problems, working within more realistic settings, and making real-world impact. The 2nd Multi-armed Bandits and Reinforcement Learning Workshop was a half day workshop co-located with the 29th ACM SIGKDD Conference on Knowledge Discovery & Data Mining (KDD 2023) in Long Beach, California.
Yingfei Wang, Daniel R. Jiang, Jinghai He, Zeyu Zheng 0002
KDD5
2023 Contextual Gaussian Process Bandits with Neural Networks
abstract
Contextual decision-making problems have witnessed extensive applications in various fields such as online content recommendation, personalized healthcare, and autonomous vehicles, where a core practical challenge is to select a suitable surrogate model for capturing unknown complicated reward functions. It is often the case that both high approximation accuracy and explicit uncertainty quantification are desired. In this work, we propose a neural network-accompanied Gaussian process (NN-AGP) model, which leverages neural networks to approximate the unknown and potentially complicated reward function regarding the contextual variable, and maintains a Gaussian process surrogate model with respect to the decision variable. Our model is shown to outperform existing approaches by offering better approximation accuracy thanks to the use of neural networks and possessing explicit uncertainty quantification from the Gaussian process. We also analyze the maximum information gain of the NN-AGP model and prove regret bounds for the corresponding algorithms. Moreover, we conduct experiments on both synthetic and practical problems, illustrating the effectiveness of our approach.
Jinghai He, Rhonda Righter, Zuo-Jun Max Shen, Zeyu Zheng 0002
NeurIPS2