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

Tian-Shyr Dai

dblp:80/778 · DBLP profile ↗
← Back
10ranked-venue papers
5as first author
3since 2021 · last 2025
0000-0002-9226-3056ORCID · reported

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

Theory of computation · 4 · 4 first-authorArtificial intelligence and machine learning · 2 · 2 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 1 first-authorSystems, architecture and hardware · 1 · 1 since 2021Databases, data management, data science and information retrieval · 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.

Theoretical computer science
1 paper
Algorithms and data structures · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational finance and economics · 100%

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

TopicWeightPapersLastEvidence papers
Algorithms and data structures › number-theoretic algorithms
lattice algorithms
0.012004
An exact subexponential-time lattice algorithm for Asian options · SODA 2004
Algorithms and data structures › exact exponential algorithms
subexponential algorithms
0.012004
An exact subexponential-time lattice algorithm for Asian options · SODA 2004
Computational finance and economics
option pricing
0.012004
An exact subexponential-time lattice algorithm for Asian options · SODA 2004

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

lattice basis reduction · 0.1
YearPublicationVenuePosition
2025 Fund transfer fraud detection: Analyzing irregular transactions and customer relationships with self-attention and graph neural networks
Yi-Cheng Shih, Tian-Shyr Dai, Ying-Ping Chen, Yen-Wu Ti, Wun-Hao Wang, Yun Kuo
Expert Syst. Appl.2
2024 Accurate Neural Network Option Pricing Methods with Control Variate Techniques and Data Synthesis/Cleaning with Financial Rationality
abstract
This paper enhances option pricing accuracy by incorporating financial expertise into a neural network (NN) design and optimizing data sample quality through cleaning and synthesis. Instead of directly estimating option values (OVs) with NNs, we leverage the concept of control variate by decomposing OVs as time values (TVs) estimated by NNs, plus the analytically solvable intrinsic values (IVs). TV surface can be decomposed into two scenarios with very different properties, and we design two NNs according to our derived no-arbitrage constraints for these two scenarios. To alleviate learning inaccuracy due to the kink of the TV surface along the scenario boundary, we synthesize training samples based on our derived constraints to smoothly extend the surface for each scenario. On the other hand, irrational option quotes commonly found in illiquid markets incur uneven surfaces, significantly deteriorating NN predictability. We develop a learnable data-cleaning method to remove potentially irrational quotes spotted by no-arbitrage constraints properly. Besides, unnecessary data syntheses proposed in previous literature can also be removed by incorporating corresponding constraints into our NN to enhance training efficiency. Comprehensive experiments on liquid S&P 500 and illiquid TAIEX option markets examine the superiority of our approach.
Chia-Wei Hsu, Tian-Shyr Dai, Chuan-Ju Wang, Ying-Ping Chen
CIKM2
2022 Structural break-aware pairs trading strategy using deep reinforcement learning
Jing-You Lu, Hsu-Chao Lai, Wen-Yueh Shih, Yi-Feng Chen, Shen-Hang Huang, Hao-Han Chang, Jun-Zhe Wang, Jiun-Long Huang, Tian-Shyr Dai
J. Supercomput.9
2014 Cloud Asset Pricing Tree (CAPT) - Elastic Economic Model for Cloud Service Providers
abstract
Providers are incorporating novel techniques to cope with prospective aspects of trading like resource allocation over future demands and its pricing elasticity that was not foreseen before. To leverage the pricing elasticity of upcoming demand and supply, we employ financial option theory (future contracts) as a mechanism to alleviate the risk in resource allocation over future demands. This study introduces a novel Cloud Asset Pricing Tree (CAPT) model that finds the optimal premium price of the Cloud federation options efficiently. Providers will benefit by this model to make decisions when to buy options in advance and when to exercise them to achieve more economies of scale. The CAPT model adapts its structure to address the price elasticity concerns and makes the demand and provisioning, price inelastic. Our empirical evidences suggest that using the CAPT model, exploits the Cloud market potential as an opportunity for more resource utilization and future capacity planning.
Soheil Qanbari, Fei Li 0002, Schahram Dustdar, Tian-Shyr Dai
CLOSER4
2012 A multi-phase, flexible, and accurate lattice for pricing complex derivatives with multiple market variables
abstract
With the rapid growth of financial markets, many complex derivatives have been structured to meet specific financial goals. But most complex derivatives have no analytical formulas for their prices, e.g., when more than one market variable is factored. As a result, they must be priced by numerical methods such as lattice. A derivative is called multivariate if its value depends on more than one market variable. A lattice for a multivariate derivative is called a multivariate lattice. This paper proposes a flexible multi-phase method to build a multivariate lattice for pricing derivatives accurately. First, the original, correlated processes are transformed into uncorrelated ones by the orthogonalization method. A multivariate lattice is then constructed for the transformed, uncorrelated processes. To sharply reduce the nonlinearity error of many numerical pricing methods, our lattice has the flexibility to match the so-called “critical locations” - the locations where nonlinearity of the derivative's value function occurs. Numerical results for vulnerable options, insurance contracts guaranteed minimum withdrawal benefit, and defaultable bonds show that our methodology can be applied to the pricing of a wide range of complex financial contracts.
Chuan-Ju Wang, Tian-Shyr Dai, Yuh-Dauh Lyuu
CIFEr2
2007 An Efficient, and Fast Convergent Algorithm for Barrier Options
Tian-Shyr Dai, Yuh-Dauh Lyuu
AAIM1
2007 An Ingenious, Piecewise Linear Interpolation Algorithm for Pricing Arithmetic Average Options
Tian-Shyr Dai, Jr-Yan Wang, Hui-Shan Wei
AAIM1
2007 An exact subexponential-time lattice algorithm for Asian options
Tian-Shyr Dai, Yuh-Dauh Lyuu
Acta Informatica1
2004 An exact subexponential-time lattice algorithm for Asian options
Tian-Shyr Dai, Yuh-Dauh Lyuu
SODA1
2003 Analytics and algorithms for geometric average trigger reset options
abstract
The geometric average trigger reset option resets the strike price based on the geometric average of the underlying asset's prices over a monitoring window. This paper derives an analytic formula and two numerical methods for pricing this option with multiple resets. The analytic formula in fact is a corollary of a general formula that holds for a large class of path-dependent options: It prices any option whose payoff function can be written as e/sup b/spl middot/X/1/sub {X/spl isin/A}/. For general American-style reset options, an O(n/sup 4/h/sup 2/)-time algorithm on n-period binomial lattice is presented. A much more efficient O(n/sup 3/ hm)-time algorithm prices European-style reset options. Monte Carlo simulation suggests that the European-style geometric average trigger reset option and the arithmetic version have similar option values. This implies that results in this paper give tight prices for the difficult arithmetic version.
Tian-Shyr Dai, I-Yuan Chen, Yuh-Yuan Fang, Yuh-Dauh Lyuu
CIFEr1