Wittawat Jitkrittum

Dr. Wittawat Jitkrittum

Google
orcid

Research Focus & Metrics

Academic Career Length

19Years (2008-Present)

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

Representative Publications

View All Publications
23 October 2022
Verified
Book Chapter
Closed access
PDF file
PSPatsorn Sangkloy
Patsorn Sangkloy
WJWittawat Jitkrittum
Wittawat Jitkrittum
DYDiyi Yang
Diyi Yang
JHJames Hays
James Hays

1 January 2013 in IEICE Transactions on Information and Systems
Verified
Journal Article
Closed access
PDF file
WJWittawat Jitkrittum
Wittawat Jitkrittum
HHHirotaka Hachiya
Hirotaka Hachiya
MSMasashi Sugiyama
Masashi Sugiyama
Japan's largest platform for academic e-journals: J-STAGE is a full text database for reviewed academic papers published by Japanese societies

1 December 2008
Verified
Conference Paper
Closed access
CHChoochart Haruechaiyasak
Choochart Haruechaiyasak
WJWittawat Jitkrittum
Wittawat Jitkrittum
CSChatchawal Sangkeettrakarn
Chatchawal Sangkeettrakarn
CDChaianun Damrongrat
Chaianun Damrongrat
We propose a feature called category browsing to enhance the full-text search function of Thai-language news article search engine. The category browsing allows users to browse and filter search results based on some predefined categories. To implement the category browsing feature, we applied and compared among several text categorization algorithms including decision tree, Naive Bayes (NB) and Support Vector Machines (SVM). To further increase the performance of text categorization, we performed evaluation among many feature selection techniques including document frequency thresholding (DF), information gain (IG) and x2 (CHI). Based on our experiments using a large news corpus, the SVM algorithm with the IG feature selection yielded the best performance with the F1 measure equal to 95.42%.

27 July 2021 in Entropy
Verified
Journal Article
Open access
PDF file
MPMijung Park
Mijung Park
MVMargarita Vinaroz
Margarita Vinaroz
WJWittawat Jitkrittum
Wittawat Jitkrittum
We developed a novel approximate Bayesian computation (ABC) framework, ABCDP, which produces differentially private (DP) and approximate posterior samples. Our framework takes advantage of the sparse vector technique (SVT), widely studied in the differential privacy literature. SVT incurs the privacy cost only when a condition (whether a quantity of interest is above/below a threshold) is met. If the condition is sparsely met during the repeated queries, SVT can drastically reduce the cumulative privacy loss, unlike the usual case where every query incurs the privacy loss. In ABC, the quantity of interest is the distance between observed and simulated data, and only when the distance is below a threshold can we take the corresponding prior sample as a posterior sample. Hence, applying SVT to ABC is an organic way to transform an ABC algorithm to a privacy-preserving variant with minimal modification, but yields the posterior samples with a high privacy level. We theoretically analyzed the interplay between the noise added for privacy and the accuracy of the posterior samples. We apply ABCDP to several data simulators and show the efficacy of the proposed framework.

24 October 2017 in arXiv
Verified
Preprint
Open access
PDF file
WJWittawat Jitkrittum
Wittawat Jitkrittum
WXWenkai Xu
Wenkai Xu
ZSZoltan Szabo
Zoltan Szabo
KFKenji Fukumizu
Kenji Fukumizu
AGArthur Gretton
Arthur Gretton
We propose a novel adaptive test of goodness-of-fit, with computational cost linear in the number of samples. We learn the test features that best indicate the differences between observed samples and a reference model, by minimizing the false negative rate. These features are constructed via Stein's method, meaning that it is not necessary to compute the normalising constant of the model. We analyse the asymptotic Bahadur efficiency of the new test, and prove that under a mean-shift alternative, our test always has greater relative efficiency than a previous linear-time kernel test, regardless of the choice of parameters for that test. In experiments, the performance of our method exceeds that of the earlier linear-time test, and matches or exceeds the power of a quadratic-time kernel test. In high dimensions and where model structure may be exploited, our goodness of fit test performs far better than a quadratic-time two-sample test based on the Maximum Mean Discrepancy, with samples drawn from the model.

30 June 2020 in arXiv
Verified
Preprint
Open access
PDF file
WJWittawat Jitkrittum
Wittawat Jitkrittum
HKHeishiro Kanagawa
Heishiro Kanagawa
BSBernhard Schölkopf
Bernhard Schölkopf
We propose two nonparametric statistical tests of goodness of fit for conditional distributions: given a conditional probability density function $p(y|x)$ and a joint sample, decide whether the sample is drawn from $p(y|x)r_x(x)$ for some density $r_x$. Our tests, formulated with a Stein operator, can be applied to any differentiable conditional density model, and require no knowledge of the normalizing constant. We show that 1) our tests are consistent against any fixed alternative conditional model; 2) the statistics can be estimated easily, requiring no density estimation as an intermediate step; and 3) our second test offers an interpretable test result providing insight on where the conditional model does not fit well in the domain of the covariate. We demonstrate the interpretability of our test on a task of modeling the distribution of New York City's taxi drop-off location given a pick-up point. To our knowledge, our work is the first to propose such conditional goodness-of-fit tests that simultaneously have all these desirable properties.