Julius Andrikonis
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Julius Andrikonis has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Aistis Raudys
Vilnius University
1 shared publication - Linas Lazaravičius
Independent Researcher, LT-08303 Vilnius, Lithuania
1 shared publication - Linas Žvirblis
Independent Researcher, LT-08303 Vilnius, Lithuania
1 shared publication - Pijus Zlatkus
Independent Researcher, LT-08303 Vilnius, Lithuania
1 shared publication - Regimantas Pliuškevičius
Vilnius University
1 shared publication - Rimantas Vaicekauskas
Institute of Computer Science, Faculty of Mathematics and Informatics, Vilnius University, Didlaukio g. 47, LT-08303 Vilnius, Lithuania
1 shared publication
Latest Publications
- Open Access
Optimized Moving Average Smoothing for Volatility Forecasting in Futures Markets
Common moving averages (MAs) used for volatility forecasting rely on fixed heuristic weights. We propose a Custom Moving Average (CMA) whose weights are learned to forecast the next-day True Range (TR). Using daily OHLC data for 55 futures contracts with a chronological 60/20/20 train/validation/test split, CMA weights are optimized for each look-back period p by projected subgradient descent against Mean Absolute Error (MAE), with validation-based early stopping. We benchmark CMA against nine standard MAs over 62 look-back periods, selecting the period on validation and reporting accuracy on the held-out test set. Learned weights concentrate on an effective horizon of 15–20 observations regardless of p: about 85% of the mass sits in lags 0–14 for both and . EMA is the validation-best method at very short windows; CMA dominates from onwards, winning on 53 of 55 instruments by . Under a single-global-period rule, CMA at attains the lowest test-set geometric-mean MAE, with EMA at the closest competitor (0.87% higher); per-instrument validation selection does not overturn the ranking, with EMA again closest at 0.53%. Higher-order smoothers (T3, TEMA, DEMA) do not improve on CMA under either rule; CMA’s advantage is robust to the choice of selection granularity.Open AccessOptimized Moving Average Smoothing for Volatility Forecasting in Futures Markets
Common moving averages (MAs) used for volatility forecasting rely on fixed heuristic weights. We propose a Custom Moving Average (CMA) whose weights are learned to forecast the next-day True Range (TR). Using daily OHLC data for 55 futures contracts with a chronological 60/20/20 train/validation/test split, CMA weights are optimized for each look-back period p by projected subgradient descent against Mean Absolute Error (MAE), with validation-based early stopping. We benchmark CMA against nine standard MAs over 62 look-back periods, selecting the period on validation and reporting accuracy on the held-out test set. Learned weights concentrate on an effective horizon of 15–20 observations regardless of p: about 85% of the mass sits in lags 0–14 for both and . EMA is the validation-best method at very short windows; CMA dominates from onwards, winning on 53 of 55 instruments by . Under a single-global-period rule, CMA at attains the lowest test-set geometric-mean MAE, with EMA at the closest competitor (0.87% higher); per-instrument validation selection does not overturn the ranking, with EMA again closest at 0.53%. Higher-order smoothers (T3, TEMA, DEMA) do not improve on CMA under either rule; CMA’s advantage is robust to the choice of selection granularity. - 1 April 2012
- Published by Springer Nature in Lithuanian Mathematical Journal
- Vol. 52 (2) , 123-133
Loop-free calculus for modal logic S4. II
- 1 April 2012
- Published by Springer Nature in Lithuanian Mathematical Journal
- Vol. 52 (2) , 123-133
Loop-free calculus for modal logic S4. II
- 1 January 2012
- Published by Springer Nature in Lithuanian Mathematical Journal
- Vol. 52 (1) , 1-12
Loop-free calculus for modal logic S4. I
- 1 January 2012
- Published by Springer Nature in Lithuanian Mathematical Journal
- Vol. 52 (1) , 1-12
Loop-free calculus for modal logic S4. I
- Open Access
- 15 December 2011
- Published by Vilnius University Press in Lietuvos matematikos rinkinys
- Vol. 52, 237–242
Contraction-free calculi for modal logics S5 and KD45
It is known that termination and backtracking are among the most important problems in constructing derivations in non-classical logics. In this paper contractionfree and backtracking-free sequent calculi for modal logics S5 and KD45 are presented and founded. These are index-style sequent calculi with some specific indexed axioms. The main new ideas in considered calculi are to use metavariables (along with natural numbers) as elements of indexes and to numerate by different natural number all the positive occurrences of modality 2.
- 15 December 2011
- Published by Vilnius University Press in Lietuvos matematikos rinkinys
- Vol. 52, 237–242
Open AccessContraction-free calculi for modal logics S5 and KD45
It is known that termination and backtracking are among the most important problems in constructing derivations in non-classical logics. In this paper contractionfree and backtracking-free sequent calculi for modal logics S5 and KD45 are presented and founded. These are index-style sequent calculi with some specific indexed axioms. The main new ideas in considered calculi are to use metavariables (along with natural numbers) as elements of indexes and to numerate by different natural number all the positive occurrences of modality 2.