1,587 research outputs found
FLANN Based Model to Predict Stock Price Movements of Stock Indices
Financial Forecasting or specifically Stock Market prediction is one of the hottest fields of research lately due to its commercial applications owing to the high stakes and the kinds of attractive benefits that it has to offer. Forecasting the price movements in stock markets has been a major challenge for common investors, businesses, brokers and speculators. As more and more money is being invested the investors get anxious of the future trends of the stock prices in the market. The primary area of concern is to determine the appropriate time to buy, hold or sell. In their quest to forecast, the investors assume that the future trends in the stock market are based at least in part on present and past events and data [1]. However financial time-series is one of the most ‘noisiest’ and ‘non-stationary’ signals present and hence very difficult to forecas
Improving the translation environment for professional translators
When using computer-aided translation systems in a typical, professional translation workflow, there are several stages at which there is room for improvement. The SCATE (Smart Computer-Aided Translation Environment) project investigated several of these aspects, both from a human-computer interaction point of view, as well as from a purely technological side.
This paper describes the SCATE research with respect to improved fuzzy matching, parallel treebanks, the integration of translation memories with machine translation, quality estimation, terminology extraction from comparable texts, the use of speech recognition in the translation process, and human computer interaction and interface design for the professional translation environment. For each of these topics, we describe the experiments we performed and the conclusions drawn, providing an overview of the highlights of the entire SCATE project
A statistical model for the steady-state behavior of the multi-split LMS algorithm
- Ce travail presente un modèle de comportement en régime permanant de l'algorithme «multi-split LMS». Des expressions de récurrences sont obtenues pour le vecteur de coefficients moyens et pour l'erreur carré moyenne. Des résultats de simulation démontrent une conformité excellent avec les prédictions théoriques et nous permettent de valider le modèle proposé
Adaptive estimation and equalisation of the high frequency communications channel
SIGLEAvailable from British Library Document Supply Centre- DSC:D94945 / BLDSC - British Library Document Supply CentreGBUnited Kingdo
Federated Learning of Gboard Language Models with Differential Privacy
We train language models (LMs) with federated learning (FL) and differential
privacy (DP) in the Google Keyboard (Gboard). We apply the
DP-Follow-the-Regularized-Leader (DP-FTRL)~\citep{kairouz21b} algorithm to
achieve meaningfully formal DP guarantees without requiring uniform sampling of
client devices. To provide favorable privacy-utility trade-offs, we introduce a
new client participation criterion and discuss the implication of its
configuration in large scale systems. We show how quantile-based clip
estimation~\citep{andrew2019differentially} can be combined with DP-FTRL to
adaptively choose the clip norm during training or reduce the hyperparameter
tuning in preparation for training. With the help of pretraining on public
data, we train and deploy more than twenty Gboard LMs that achieve high utility
and zCDP privacy guarantees with , with two models
additionally trained with secure aggregation~\citep{bonawitz2017practical}. We
are happy to announce that all the next word prediction neural network LMs in
Gboard now have DP guarantees, and all future launches of Gboard neural network
LMs will require DP guarantees. We summarize our experience and provide
concrete suggestions on DP training for practitioners.Comment: ACL industry trac
The Consensus Game: Language Model Generation via Equilibrium Search
When applied to question answering and other text generation tasks, language
models (LMs) may be queried generatively (by sampling answers from their output
distribution) or discriminatively (by using them to score or rank a set of
candidate outputs). These procedures sometimes yield very different
predictions. How do we reconcile mutually incompatible scoring procedures to
obtain coherent LM predictions? We introduce a new, a training-free,
game-theoretic procedure for language model decoding. Our approach casts
language model decoding as a regularized imperfect-information sequential
signaling game - which we term the CONSENSUS GAME - in which a GENERATOR seeks
to communicate an abstract correctness parameter using natural language
sentences to a DISCRIMINATOR. We develop computational procedures for finding
approximate equilibria of this game, resulting in a decoding algorithm we call
EQUILIBRIUM-RANKING. Applied to a large number of tasks (including reading
comprehension, commonsense reasoning, mathematical problem-solving, and
dialog), EQUILIBRIUM-RANKING consistently, and sometimes substantially,
improves performance over existing LM decoding procedures - on multiple
benchmarks, we observe that applying EQUILIBRIUM-RANKING to LLaMA-7B
outperforms the much larger LLaMA-65B and PaLM-540B models. These results
highlight the promise of game-theoretic tools for addressing fundamental
challenges of truthfulness and consistency in LMs
Turbo Decoding and Detection for Wireless Applications
A historical perspective of turbo coding and turbo transceivers inspired by the generic turbo principles is provided, as it evolved from Shannon’s visionary predictions. More specifically, we commence by discussing the turbo principles, which have been shown to be capable of performing close to Shannon’s capacity limit. We continue by reviewing the classic maximum a posteriori probability decoder. These discussions are followed by studying the effect of a range of system parameters in a systematic fashion, in order to gauge their performance ramifications. In the second part of this treatise, we focus our attention on the family of iterative receivers designed for wireless communication systems, which were partly inspired by the invention of turbo codes. More specifically, the family of iteratively detected joint coding and modulation schemes, turbo equalization, concatenated spacetime and channel coding arrangements, as well as multi-user detection and three-stage multimedia systems are highlighted
Collaborative adaptive filtering for machine learning
Quantitative performance criteria for the analysis of machine learning architectures
and algorithms have long been established. However, qualitative performance criteria,
which identify fundamental signal properties and ensure any processing preserves the
desired properties, are still emerging. In many cases, whilst offline statistical tests
exist such as assessment of nonlinearity or stochasticity, online tests which not only
characterise but also track changes in the nature of the signal are lacking. To that end,
by employing recent developments in signal characterisation, criteria are derived for
the assessment of the changes in the nature of the processed signal.
Through the fusion of the outputs of adaptive filters a single collaborative hybrid
filter is produced. By tracking the dynamics of the mixing parameter of this filter,
rather than the actual filter performance, a clear indication as to the current nature of
the signal is given. Implementations of the proposed method show that it is possible to
quantify the degree of nonlinearity within both real- and complex-valued data. This is
then extended (in the real domain) from dealing with nonlinearity in general, to a more
specific example, namely sparsity. Extensions of adaptive filters from the real to the
complex domain are non-trivial and the differences between the statistics in the real
and complex domains need to be taken into account. In terms of signal characteristics,
nonlinearity can be both split- and fully-complex and complex-valued data can be
considered circular or noncircular. Furthermore, by combining the information obtained
from hybrid filters of different natures it is possible to use this method to gain a more
complete understanding of the nature of the nonlinearity within a signal. This also
paves the way for building multidimensional feature spaces and their application in
data/information fusion.
To produce online tests for sparsity, adaptive filters for sparse environments are
investigated and a unifying framework for the derivation of proportionate normalised
least mean square (PNLMS) algorithms is presented. This is then extended to derive
variants with an adaptive step-size. In order to create an online test for noncircularity,
a study of widely linear autoregressive modelling is presented, from which a proof of
the convergence of the test for noncircularity can be given. Applications of this method
are illustrated on examples such as biomedical signals, speech and wind data
- …