pwc-archive/papers-with-abstracts huggingface dataset:
Parallel Spell-Checking Algorithm Based on Yahoo! N-Grams Dataset
Authors: Youssef Bassil
Date: 2012-04-01 00:00:00
Tasks: Articles

Spell-checking is the process of detecting and sometimes providing suggestions for incorrectly spelled words in a text. Basically, the larger the dictionary of a spell-checker is, the higher is the error detection rate; otherwise, misspellings would pass undetected. Unfortunately, traditional dictionaries suffer from out-of-vocabulary and data sparseness problems as they do not encompass large vocabulary of words indispensable to cover proper names, domain-specific terms, technical jargons, special acronyms, and terminologies. As a result, spell-checkers will incur low error detection and correction rate and will fail to flag all errors in the text. This paper proposes a new parallel shared-memory spell-checking algorithm that uses rich real-world word statistics from Yahoo! N-Grams Dataset to correct non-word and real-word errors in computer text. Essentially, the proposed algorithm can be divided into three sub-algorithms that run in a parallel fashion: The error detection algorithm that detects misspellings, the candidates generation algorithm that generates correction suggestions, and the error correction algorithm that performs contextual error correction. Experiments conducted on a set of text articles containing misspellings, showed a remarkable spelling error correction rate that resulted in a radical reduction of both non-word and real-word errors in electronic text. In a further study, the proposed algorithm is to be optimized for message-passing systems so as to become more flexible and less costly to scale over distributed machines.
NSML: Meet the MLaaS platform with a real-world case study
Authors: Hanjoo Kim, Minkyu Kim, Dongjoo Seo, Jinwoong Kim, Heungseok Park, Soeun Park, Hyunwoo Jo, KyungHyun Kim, Youngil Yang, Youngkwan Kim, Nako Sung, Jung-Woo Ha
Date: 2018-10-08 00:00:00
Tasks: BIG-bench Machine Learning, Management

The boom of deep learning induced many industries and academies to introduce machine learning based approaches into their concern, competitively. However, existing machine learning frameworks are limited to sufficiently fulfill the collaboration and management for both data and models. We proposed NSML, a machine learning as a service (MLaaS) platform, to meet these demands. NSML helps machine learning work be easily launched on a NSML cluster and provides a collaborative environment which can afford development at enterprise scale. Finally, NSML users can deploy their own commercial services with NSML cluster. In addition, NSML furnishes convenient visualization tools which assist the users in analyzing their work. To verify the usefulness and accessibility of NSML, we performed some experiments with common examples. Furthermore, we examined the collaborative advantages of NSML through three competitions with real-world use cases.
Bayesian Optimal Active Search and Surveying
Authors: Roman Garnett, Yamuna Krishnamurthy, Xuehan Xiong, Jeff Schneider, Richard Mann
Date: 2012-06-27 00:00:00
Tasks: Binary Classification

We consider two active binary-classification problems with atypical objectives. In the first, active search, our goal is to actively uncover as many members of a given class as possible. In the second, active surveying, our goal is to actively query points to ultimately predict the proportion of a given class. Numerous real-world problems can be framed in these terms, and in either case typical model-based concerns such as generalization error are only of secondary importance. We approach these problems via Bayesian decision theory; after choosing natural utility functions, we derive the optimal policies. We provide three contributions. In addition to introducing the active surveying problem, we extend previous work on active search in two ways. First, we prove a novel theoretical result, that less-myopic approximations to the optimal policy can outperform more-myopic approximations by any arbitrary degree. We then derive bounds that for certain models allow us to reduce (in practice dramatically) the exponential search space required by a naive implementation of the optimal policy, enabling further lookahead while still ensuring that optimal decisions are always made.
An information-theoretic account of semantic interference in word production
Authors: Richard Futrell
Date: 2020-06-22 00:00:00

I present a computational-level model of semantic interference effects in word production. Word production is cast as a rate-distortion problem where an agent selects words to minimize a measure of cost while also minimizing the resources used to compute the output word based on perceptual input and behavioral goals. I show that similarity-based interference among words arises naturally in this setup, and I present a series of simulations showing that the model captures some of the key empirical patterns observed in Stroop and Picture-Word Interference paradigms. I argue that the rate-distortion account of interference provides a high-level formalization of computational principles that are instantiated more mechanistically in existing models.
Sum-Product Networks: A New Deep Architecture
Authors: Hoifung Poon, Pedro Domingos
Date: 2012-02-14 00:00:00

The key limiting factor in graphical model inference and learning is the complexity of the partition function. We thus ask the question: what are general conditions under which the partition function is tractable? The answer leads to a new kind of deep architecture, which we call sum-product networks (SPNs). SPNs are directed acyclic graphs with variables as leaves, sums and products as internal nodes, and weighted edges. We show that if an SPN is complete and consistent it represents the partition function and all marginals of some graphical model, and give semantics to its nodes. Essentially all tractable graphical models can be cast as SPNs, but SPNs are also strictly more general. We then propose learning algorithms for SPNs, based on backpropagation and EM. Experiments show that inference and learning with SPNs can be both faster and more accurate than with standard deep networks. For example, SPNs perform image completion better than state-of-the-art deep networks for this task. SPNs also have intriguing potential connections to the architecture of the cortex.
Towards a Mathematical Foundation of Immunology and Amino Acid Chains
Authors: Wen-Jun Shen, Hau-San Wong, Quan-Wu Xiao, Xin Guo, Stephen Smale
Date: 2012-05-28 00:00:00
Tasks: Clustering

We attempt to set a mathematical foundation of immunology and amino acid chains. To measure the similarities of these chains, a kernel on strings is defined using only the sequence of the chains and a good amino acid substitution matrix (e.g. BLOSUM62). The kernel is used in learning machines to predict binding affinities of peptides to human leukocyte antigens DR (HLA-DR) molecules. On both fixed allele (Nielsen and Lund 2009) and pan-allele (Nielsen et.al. 2010) benchmark databases, our algorithm achieves the state-of-the-art performance. The kernel is also used to define a distance on an HLA-DR allele set based on which a clustering analysis precisely recovers the serotype classifications assigned by WHO (Nielsen and Lund 2009, and Marsh et.al. 2010). These results suggest that our kernel relates well the chain structure of both peptides and HLA-DR molecules to their biological functions, and that it offers a simple, powerful and promising methodology to immunology and amino acid chain studies.
Speech Separation Based on Multi-Stage Elaborated Dual-Path Deep BiLSTM with Auxiliary Identity Loss
Authors: Ziqiang Shi, Rujie Liu, Jiqing Han
Date: 2020-08-06 00:00:00
Tasks: Speaker Separation, Speech Separation

Deep neural network with dual-path bi-directional long short-term memory (BiLSTM) block has been proved to be very effective in sequence modeling, especially in speech separation. This work investigates how to extend dual-path BiLSTM to result in a new state-of-the-art approach, called TasTas, for multi-talker monaural speech separation (a.k.a cocktail party problem). TasTas introduces two simple but effective improvements, one is an iterative multi-stage refinement scheme, and the other is to correct the speech with imperfect separation through a loss of speaker identity consistency between the separated speech and original speech, to boost the performance of dual-path BiLSTM based networks. TasTas takes the mixed utterance of two speakers and maps it to two separated utterances, where each utterance contains only one speaker's voice. Our experiments on the notable benchmark WSJ0-2mix data corpus result in 20.55dB SDR improvement, 20.35dB SI-SDR improvement, 3.69 of PESQ, and 94.86\% of ESTOI, which shows that our proposed networks can lead to big performance improvement on the speaker separation task. We have open sourced our re-implementation of the DPRNN-TasNet here (https://github.com/ShiZiqiang/dual-path-RNNs-DPRNNs-based-speech-separation), and our TasTas is realized based on this implementation of DPRNN-TasNet, it is believed that the results in this paper can be reproduced with ease.
Inverse problems in approximate uniform generation
Authors: Anindya De, Ilias Diakonikolas, Rocco A. Servedio
Date: 2012-11-07 00:00:00

We initiate the study of \emph{inverse} problems in approximate uniform generation, focusing on uniform generation of satisfying assignments of various types of Boolean functions. In such an inverse problem, the algorithm is given uniform random satisfying assignments of an unknown function $f$ belonging to a class $\C$ of Boolean functions, and the goal is to output a probability distribution $D$ which is $\epsilon$-close, in total variation distance, to the uniform distribution over $f^{-1}(1)$. Positive results: We prove a general positive result establishing sufficient conditions for efficient inverse approximate uniform generation for a class $\C$. We define a new type of algorithm called a \emph{densifier} for $\C$, and show (roughly speaking) how to combine (i) a densifier, (ii) an approximate counting / uniform generation algorithm, and (iii) a Statistical Query learning algorithm, to obtain an inverse approximate uniform generation algorithm. We apply this general result to obtain a poly$(n,1/\eps)$-time algorithm for the class of halfspaces; and a quasipoly$(n,1/\eps)$-time algorithm for the class of $\poly(n)$-size DNF formulas. Negative results: We prove a general negative result establishing that the existence of certain types of signature schemes in cryptography implies the hardness of certain inverse approximate uniform generation problems. This implies that there are no {subexponential}-time inverse approximate uniform generation algorithms for 3-CNF formulas; for intersections of two halfspaces; for degree-2 polynomial threshold functions; and for monotone 2-CNF formulas. Finally, we show that there is no general relationship between the complexity of the "forward" approximate uniform generation problem and the complexity of the inverse problem for a class $\C$ -- it is possible for either one to be easy while the other is hard.
Solving Inverse Problems with Piecewise Linear Estimators: From Gaussian Mixture Models to Structured Sparsity
Authors: Guoshen Yu, Guillermo Sapiro, Stéphane Mallat
Date: 2010-06-15 00:00:00
Tasks: Deblurring

A general framework for solving image inverse problems is introduced in this paper. The approach is based on Gaussian mixture models, estimated via a computationally efficient MAP-EM algorithm. A dual mathematical interpretation of the proposed framework with structured sparse estimation is described, which shows that the resulting piecewise linear estimate stabilizes the estimation when compared to traditional sparse inverse problem techniques. This interpretation also suggests an effective dictionary motivated initialization for the MAP-EM algorithm. We demonstrate that in a number of image inverse problems, including inpainting, zooming, and deblurring, the same algorithm produces either equal, often significantly better, or very small margin worse results than the best published ones, at a lower computational cost.
COVID-19 and Global Economic Growth: Policy Simulations with a Pandemic-Enabled Neoclassical Growth Model
Authors: Ian M. Trotter, Luís A. C. Schmidt, Bruno C. M. Pinto, Andrezza L. Batista, Jéssica Pellenz, Maritza Isidro, Aline Rodrigues, Attawan G. S. Suela, Loredany Rodrigues
Date: 2020-05-28 00:00:00

During the COVID-19 pandemic of 2019/2020, authorities have used temporary ad-hoc policy measures, such as lockdowns and mass quarantines, to slow its transmission. However, the consequences of widespread use of these unprecedented measures are poorly understood. To contribute to the understanding of the economic and human consequences of such policy measures, we therefore construct a mathematical model of an economy under the impact of a pandemic, select parameter values to represent the global economy under the impact of COVID-19, and perform numerical experiments by simulating a large number of possible policy responses. By varying the starting date of the policy intervention in the simulated scenarios, we find that the most effective policy intervention occurs around the time when the number of active infections is growing at its highest rate -- that is, the results suggest that the most severe measures should only be implemented when the disease is sufficiently spread. The intensity of the intervention, above a certain threshold, does not appear to have a great impact on the outcomes in our simulations, due to the strongly concave relationship that we identify between production shortfall and infection rate reductions. Our experiments further suggest that the intervention should last until after the peak established by the reduced infection rate, which implies that stricter policies should last longer. The model and its implementation, along with the general insights from our policy experiments, may help policymakers design effective emergency policy responses in the face of a serious pandemic, and contribute to our understanding of the relationship between the economic growth and the spread of infectious diseases.
Multiscale Granger causality analysis by à trous wavelet transform
Authors: Sebastiano Stramaglia, Iege Bassez, Luca Faes, Daniele Marinazzo
Date: 2017-07-12 00:00:00
Tasks: EEG, Electroencephalogram (EEG)

Since interactions in neural systems occur across multiple temporal scales, it is likely that information flow will exhibit a multiscale structure, thus requiring a multiscale generalization of classical temporal precedence causality analysis like Granger's approach. However, the computation of multiscale measures of information dynamics is complicated by theoretical and practical issues such as filtering and undersampling: to overcome these problems, we propose a wavelet-based approach for multiscale Granger causality (GC) analysis, which is characterized by the following properties: (i) only the candidate driver variable is wavelet transformed (ii) the decomposition is performed using the \`a trous wavelet transform with cubic B-spline filter. We measure GC, at a given scale, by including the wavelet coefficients of the driver times series, at that scale, in the regression model of the target. To validate our method, we apply it to publicly available scalp EEG signals, and we find that the condition of closed eyes, at rest, is characterized by an enhanced GC among channels at slow scales w.r.t. eye open condition, whilst the standard Granger causality is not significantly different in the two conditions.
Convergence Guarantees for Non-Convex Optimisation with Cauchy-Based Penalties
Authors: Oktay Karakus, Perla Mayo, Alin Achim
Date: 2020-03-10 00:00:00
Tasks: Denoising, Image Reconstruction

In this paper, we propose a proximal splitting methodology with a non-convex penalty function based on the heavy-tailed Cauchy distribution. We first suggest a closed-form expression for calculating the proximal operator of the Cauchy prior, which then makes it applicable in generic proximal splitting algorithms. We further derive the condition required for guaranteed convergence to a solution in optimisation problems involving the Cauchy based penalty function. Setting the system parameters by satisfying the proposed condition ensures convergence even though the overall cost function is non-convex when minimisation is performed via a proximal splitting algorithm. The proposed method based on Cauchy regularisation is evaluated by solving generic signal processing examples, i.e. 1D signal denoising in the frequency domain, two image reconstruction tasks including de-blurring and denoising, and error recovery in a multiple-antenna communication system. We experimentally verify the proposed convergence conditions for various cases, and show the effectiveness of the proposed Cauchy based non-convex penalty function over state-of-the-art penalty functions such as $L_1$ and total variation ($TV$) norms.
How to Search the Internet Archive Without Indexing It
Authors: Nattiya Kanhabua, Philipp Kemkes, Wolfgang Nejdl, Tu Ngoc Nguyen, Felipe Reis, Nam Khanh Tran
Date: 2017-01-28 00:00:00
Tasks: Retrieval

Significant parts of cultural heritage are produced on the web during the last decades. While easy accessibility to the current web is a good baseline, optimal access to the past web faces several challenges. This includes dealing with large-scale web archive collections and lacking of usage logs that contain implicit human feedback most relevant for today's web search. In this paper, we propose an entity-oriented search system to support retrieval and analytics on the Internet Archive. We use Bing to retrieve a ranked list of results from the current web. In addition, we link retrieved results to the WayBack Machine; thus allowing keyword search on the Internet Archive without processing and indexing its raw archived content. Our search system complements existing web archive search tools through a user-friendly interface, which comes close to the functionalities of modern web search engines (e.g., keyword search, query auto-completion and related query suggestion), and provides a great benefit of taking user feedback on the current web into account also for web archive search. Through extensive experiments, we conduct quantitative and qualitative analyses in order to provide insights that enable further research on and practical applications of web archives.
Stochastic reaction networks in dynamic compartment populations
Authors: Lorenzo Duso, Christoph Zechner
Date: 2020-02-03 00:00:00

Compartmentalization of biochemical processes underlies all biological systems, from the organelle to the tissue scale. Theoretical models to study the interplay between noisy reaction dynamics and compartmentalization are sparse, and typically very challenging to analyze computationally. Recent studies have made progress towards addressing this problem in the context of concrete biological systems but general approaches remain lacking. In this work we propose a mathematical framework based on counting processes that allows us to study compartment populations with arbitrary interactions and internal biochemistry. We provide an efficient description of the population dynamics in terms of differential equations which capture moments of the population and their variability. We demonstrate the relevance of our approach using several case studies inspired by biological systems at different scales.
Accuracy of Deep Learning in Calibrating HJM Forward Curves
Authors: Fred Espen Benth, Nils Detering, Silvia Lavagnini
Date: 2020-06-02 00:00:00
Tasks: Deep Learning

We price European-style options written on forward contracts in a commodity market, which we model with an infinite-dimensional Heath-Jarrow-Morton (HJM) approach. For this purpose we introduce a new class of state-dependent volatility operators that map the square integrable noise into the Filipovi\'{c} space of forward curves. For calibration, we specify a fully parametrized version of our model and train a neural network to approximate the true option price as a function of the model parameters. This neural network can then be used to calibrate the HJM parameters based on observed option prices. We conduct a numerical case study based on artificially generated option prices in a deterministic volatility setting. In this setting we derive closed pricing formulas, allowing us to benchmark the neural network based calibration approach. We also study calibration in illiquid markets with a large bid-ask spread. The experiments reveal a high degree of accuracy in recovering the prices after calibration, even if the original meaning of the model parameters is partly lost in the approximation step.
LFP beta amplitude is predictive of mesoscopic spatio-temporal phase patterns
Authors: Michael Denker, Lyuba Zehl, Bjørg E. Kilavik, Markus Diesmann, Thomas Brochier, Alexa Riehle, Sonja Grün
Date: 2017-03-28 00:00:00

Beta oscillations observed in motor cortical local field potentials (LFPs) recorded on separate electrodes of a multi-electrode array have been shown to exhibit non-zero phase shifts that organize into a planar wave propagation. Here, we generalize this concept by introducing additional classes of patterns that fully describe the spatial organization of beta oscillations. During a delayed reach-to-grasp task in monkey primary motor and dorsal premotor cortices we distinguish planar, synchronized, random, circular, and radial phase patterns. We observe that specific patterns correlate with the beta amplitude (envelope). In particular, wave propagation accelerates with growing amplitude, and culminates at maximum amplitude in a synchronized pattern. Furthermore, the occurrence probability of a particular pattern is modulated with behavioral epochs: Planar waves and synchronized patterns are more present during movement preparation where beta amplitudes are large, whereas random phase patterns are dominant during movement execution where beta amplitudes are small.
Inferring Point Cloud Quality via Graph Similarity
Authors: Qi Yang, Zhan Ma, Yiling Xu, Zhu Li, Jun Sun
Date: 2020-05-31 00:00:00
Tasks: All, Graph Similarity

We propose the GraphSIM -- an objective metric to accurately predict the subjective quality of point cloud with superimposed geometry and color impairments. Motivated by the facts that human vision system is more sensitive to the high spatial-frequency components (e.g., contours, edges), and weighs more to the local structural variations rather individual point intensity, we first extract geometric keypoints by resampling the reference point cloud geometry information to form the object skeleton; we then construct local graphs centered at these keypoints for both reference and distorted point clouds, followed by collectively aggregating color gradient moments (e.g., zeroth, first, and second) that are derived between all other points and centered keypoint in the same local graph for significant feature similarity (a.k.a., local significance) measurement; Final similarity index is obtained by pooling the local graph significance across all color channels and by averaging across all graphs. Our GraphSIM is validated using two large and independent point cloud assessment datasets that involve a wide range of impairments (e.g., re-sampling, compression, additive noise), reliably demonstrating the state-of-the-art performance for all distortions with noticeable gains in predicting the subjective mean opinion score (MOS), compared with those point-wise distance-based metrics adopted in standardization reference software. Ablation studies have further shown that GraphSIM is generalized to various scenarios with consistent performance by examining its key modules and parameters.