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

Kelvin J. L. Koa

dblp:356/3939 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
3since 2021 · last 2026
0000-0002-1226-149XORCID · corroborated

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

Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021Databases, data management, data science and information retrieval · 2 · 2 first-author · 2 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 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.

Interdisciplinary, comprehensive, and emerging computing
2 papers
Computational finance and economics · 60% Computational social science and digital humanities · 40%
Artificial intelligence
2 papers
Language models and text generation · 42% Knowledge representation and reasoning · 42% Representation and self-supervised learning · 16%

Topics — the 5 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Knowledge, reasoning and agents › Knowledge representation and reasoning
explanation generation
0.812024
Learning to Generate Explainable Stock Predictions using Self-Reflective Large Language Models · WWW 2024
Natural language and speech › Language models and text generation › text generation
interpretable text generation
0.812024
Learning to Generate Explainable Stock Predictions using Self-Reflective Large Language Models · WWW 2024
Computational finance and economics
financial forecasting
0.812024
Learning to Generate Explainable Stock Predictions using Self-Reflective Large Language Models · WWW 2024
Computational finance and economics › financial market prediction › stock prediction
stock movement prediction
0.812024
Learning to Generate Explainable Stock Predictions using Self-Reflective Large Language Models · WWW 2024
Machine learning › Representation and self-supervised learning › representation learning › embedding learning
semantic embedding
0.312026
The Proxy Presumption: From Semantic Embeddings to Valid Social Measures · ACL (1) 2026

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

large language model · 3.5psychometrics · 2.0causal representation learning · 2.0self-reflection · 1.5reinforcement learning from human feedback · 1.5
YearPublicationVenuePosition
2026 The Proxy Presumption: From Semantic Embeddings to Valid Social Measures
abstract
Natural Language Processing is rapidly evolving into a primary instrument for Computational Social Science, with researchers increasingly using embeddings to measure latent constructs such as novelty, creativity, and bias.However, this transition faces a fundamental validity challenge: the "Proxy Presumption," or the reliance on geometric properties (e.g., cosine distance) as direct measures of social concepts.We argue that without explicit validation, unsupervised representations remain entangled mixtures of the target construct (C) and confounding attributes (Z) like topic, style, and authorship.To bridge the gap between semantic embeddings and valid social measures, we introduce the Construct Validity Protocol (CVP).Drawing on causal representation learning and psychometrics, the CVP offers a rigorous pipeline from conceptualization to quantitative verification.We further propose Counterfactual Neutralization, a novel method using LLMs to reduce confounding in embedding space.By providing a standardized Validity Suite-including tests for discriminant, incremental, and predictive validity-this work offers the community a toolkit to transform heuristic proxies into robust, scientifically defensible instruments.
Baishi Li, Ta Yu, Kelvin J. L. Koa, Kewei Huang
ACL (1)3
2024 Learning to Generate Explainable Stock Predictions using Self-Reflective Large Language Models
abstract
Explaining stock predictions is generally a difficult task for traditional non-generative deep learning models, where explanations are limited to visualizing the attention weights on important texts. Today, Large Language Models (LLMs) present a solution to this problem, given their known capabilities to generate human-readable explanations for their decision-making process. However, the task of stock prediction remains challenging for LLMs, as it requires the ability to weigh the varying impacts of chaotic social texts on stock prices. The problem gets progressively harder with the introduction of the explanation component, which requires LLMs to explain verbally why certain factors are more important than the others. On the other hand, to fine-tune LLMs for such a task, one would need expert-annotated samples of explanation for every stock movement in the training set, which is expensive and impractical to scale.
Kelvin J. L. Koa, Yunshan Ma 0002, Ritchie Ng, Tat-Seng Chua
WWW1
2023 Diffusion Variational Autoencoder for Tackling Stochasticity in Multi-Step Regression Stock Price Prediction
abstract
Multi-step stock price prediction over a long-term horizon is crucial for forecasting its volatility, allowing financial institutions to price and hedge derivatives, and banks to quantify the risk in their trading books. Additionally, most financial regulators also require a liquidity horizon of several days for institutional investors to exit their risky assets, in order to not materially affect market prices. However, the task of multi-step stock price prediction is challenging, given the highly stochastic nature of stock data. Current solutions to tackle this problem are mostly designed for single-step, classification-based predictions, and are limited to low representation expressiveness. The problem also gets progressively harder with the introduction of the target price sequence, which also contains stochastic noise and reduces generalizability at test-time.
Kelvin J. L. Koa, Yunshan Ma 0002, Ritchie Ng, Tat-Seng Chua
CIKM1