Andreas Veneris

Andreas Veneris

Auto-generated profile, based on publicly available information

Andreas Veneris

University of Toronto, Toronto, Canada

Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
22 April 2022 in The Journal of Financial Data Science
Verified
Journal Article
Closed access
PDF file
MBMaxime Bergeron
Maxime Bergeron
NFNicholas Fung
Nicholas Fung
JHJohn Hull
John Hull
ZPZissis Poulos
Zissis Poulos
AVAndreas Veneris
Andreas Veneris
A volatility surface is an important tool for pricing and hedging derivatives. The surface shows the volatility that is implied by the market price of an option on an asset as a function of the option’s strike price and maturity. Often, market data are incomplete, and it is necessary to estimate missing points on partially observed surfaces. In this article, the authors show how variational autoencoders can be used to model volatility surfaces. The first step is to train the model, deriving latent variables that can be used to construct synthetic volatility surfaces that are indistinguishable from those observed historically. The second step is to determine the synthetic surface generated by the latent variables that fits available data as closely as possible. The trained variational autoencoder can also be used to generate synthetic-yet-realistic surfaces, which can be used in stress testing, in market simulators for developing quantitative investment strategies, and for the valuation of exotic options. The authors illustrate their procedure using foreign exchange market data.

12 April 2024
Verified
Conference Paper
Open access
XDXun Deng
Xun Deng
SBSidi Mohamed Beillahi
Sidi Mohamed Beillahi
CMCyrus Minwalla
Cyrus Minwalla
HDHan Du
Han Du
AVAndreas Veneris
Andreas Veneris
FLFan Long
Fan Long

16 September 2013 in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Verified
Journal Article
Closed access
BKBrian Keng
Brian Keng
AVAndreas Veneris
Andreas Veneris
Functional verification has become one of the most time-consuming tasks in the very large scale integration design flow accounting for up to 57% of the total project time. The largest component of this task is that of design debugging due to its resource-intensive manual nature. With the ever growing size of modern designs and their error traces, the complexity of the debugging problem poses a great challenge to automated debugging techniques. To overcome this challenge, this paper introduces a novel path-directed abstraction and refinement algorithm for design debugging to manage excessive error trace lengths. A sliding window of the error trace is iteratively analyzed in a time-windowing framework, which is made possible by the use of the path-directed abstraction. This abstraction forms a concise approximation of nonmodeled parts of the error trace while simultaneously providing an efficient representation for refinement. The result is an algorithm that dramatically reduces the memory requirements of debugging while mitigating the incomplete results of past techniques. Experimental results on industrial designs with long error traces show that the proposed approach can analyze traces that are 64.6% longer while simultaneously decreasing peak memory usage compared to previous work.

13 January 2020 in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Verified
Journal Article
Closed access
NVNeil Veira
Neil Veira
ZPZissis Poulos
Zissis Poulos
AVAndreas Veneris
Andreas Veneris
Due to the excessive cost associated with manual RTL design debugging, automated tools are often employed to identify a set of suspect bug locations. To further accelerate the process, one observes that the anytime behavior of these tools allows partial results to be analyzed before the suspect search is complete. Thus, it is preferable for the tool to maximize the number of suspects that are found in the early stages of its search. Toward this end, this article proposes a new SAT-based debugging algorithm which predicts where solutions are most likely to be found and prioritize examining these locations. Two techniques are proposed to predict solution locations by learning from historical debug data. The first technique does so using belief propagation on a probabilistic graph, while the second trains a neural network to classify candidate suspects as solutions or nonsolutions. Intensive empirical evaluation demonstrates that these techniques can predict suspect sets with accuracies of 81% and 87%, respectively, but the second method requires more training data and careful hyperparameter tuning in order to do so. Furthermore, when guided by these suspect prediction models, the proposed debugging algorithm finds an average of 83% more suspects within a given amount of time.

14 November 2025
Verified
Conference Paper
Open access
YWYuntao Wu
Yuntao Wu
EAEge Mert Akin
Ege Mert Akin
CMCharles Martineau
Charles Martineau
VGVincent Grégoire
Vincent Grégoire
AVAndreas Veneris
Andreas Veneris

19 April 2011 in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Verified
Journal Article
Closed access
YYYu-Shen Yang
Yu-Shen Yang
SSSubarna Sinha
Subarna Sinha
AVAndreas Veneris
Andreas Veneris
RBRobert K. Brayton
Robert K. Brayton
During the very large scale integration design process, a synthesized design is often required to be modified in order to accommodate different goals. To preserve the engineering effort already invested, designers seek small logic structural transformations to achieve these logic restructuring goals. This paper proposes a systematic methodology to devise such transformations automatically. It first presents a simulation-based formulation to approximate sets of pairs of functions to be distinguished and avoid the memory/time explosion issue inherent with the original representation. Then, it uses this new data structure to devise the required transformations dynamically without the need of a static dictionary model. The methodology is applied to both combinational and sequential designs with transformations at a single or multiple locations. An extensive suite of experiments documents the benefits of the proposed methodology when compared to existing practices.