Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

169,051 papers · 148 categories

Trend · papers per month

1.8%3.7%5.5%7.3% · Sep 202019922001200920182026
48 results for online soft mining

This work improves deep metric learning by online soft mining and class-aware attention.

problem Slow convergence and poor performance due to a large fraction of trivial samples in deep metric learning.
method Online Soft Mining (OSM) and Class-Aware Attention (CAA) to select and focus on relevant samples.
result Significantly outperforms state-of-the-art methods on fine-grained visual categorization and video-based person re-identification datasets.

Study compares PLS, Lasso, and RVM for soft sensor design, finding Lasso superior.

problem Improving predictive performance of soft sensors in high-dimensional data.
method Comparison of three regression techniques (PLS, Lasso, RVM) on real and simulated datasets.
result Lasso outperforms PLS in offline learning with large predictor sets, but PLS remains superior with small MW sizes.

OLBoost improves online decision tree performance without increasing memory or time costs.

problem Improving predictive performance in online decision trees without high memory or time costs.
method OLBoost applies boosting to small regions of the instances space within online decision tree algorithms.
result OLBoost can significantly improve online learning decision tree performance without increasing tree size.

Sequence-to-sequence models with soft attention have been successfully applied to a wide variety of problems, but their decoding process incurs a quadratic time and space cost and is inapplicable to real-time sequence transduction. To address these issues, we propose Monotonic Chunkwise Attention (MoChA), which adaptiv…

2017-12-14abs ↗pdf ↗

OMBA learns product and user representations for better online market basket analysis.

problem Limited ability to uncover rarely occurring and temporal associations in MBA.
method Jointly learns product and user representations, captures temporal dynamics, scalable online method.
result OMBA outperforms state-of-the-art methods by 21% on real-world datasets.

Paper proposes a pretraining method for soft Q-learning from imperfect demonstrations.

problem Challenges in exploiting expert demonstrations while maintaining exploration potentials.
method γ-discounted biased policy evaluation with entropy regularization.
result Our method effectively learns from imperfect demonstrations and outperforms other methods.

Distributed, online data mining systems have emerged as a result of applications requiring analysis of large amounts of correlated and high-dimensional data produced by multiple distributed data sources. We propose a distributed online data classification framework where data is gathered by distributed data sources and…

2013-07-02abs ↗pdf ↗

Online portfolio selection is a fundamental problem in computational finance, which has been extensively studied across several research communities, including finance, statistics, artificial intelligence, machine learning, and data mining, etc. This article aims to provide a comprehensive survey and a structural under…

2012-12-10abs ↗pdf ↗

Automated process discovery is a class of process mining methods that allow analysts to extract business process models from event logs. Traditional process discovery methods extract process models from a snapshot of an event log stored in its entirety. In some scenarios, however, events keep coming with a high arrival…

2018-04-08abs ↗pdf ↗

AOPU stabilizes NN training by approximating natural gradient, improving stability and convergence.

problem Stability and interpretability in online NN training for industrial soft sensors.
method AOPU truncates gradient backpropagation, optimizing trackable parameters, and approximating natural gradient.
result AOPU achieves stable convergence and superior performance on chemical process datasets.

Active learning improves soft sensor development by suggesting informative labels.

problem Expensive labeling of process variables in industrial settings.
method Adapted active learning strategies for online data streams and used semi-supervised autoencoders.
result Improved predictive performance of soft sensors using active learning and autoencoders.

A new update rule for deep reinforcement learning reduces learning variance and variance in reference signals.

problem Learning variance and incorrect reference signals in deep reinforcement learning.
method t-soft update method inspired by student-t distribution, which reduces extreme updates and accelerates similar updates.
result The t-soft update method outperforms conventional methods in terms of return and variance in PyBullet robotics simulations.

Method detects interactions for better CTR prediction.

problem Predicting click-through rate with high-dimensional categorical features and time-varying interactions.
method Online Random Intersection Chains (ORIC) for detecting informative interactions.
result ORIC detects high-interpretability interactions that improve CTR prediction.

Unified analysis of online optimization with self-concordant barriers, improving regret bounds.

problem Online convex optimization with specific loss functions.
method Online mirror descent with self-concordant barriers and logarithmic loss.
result Improved regret bounds for online portfolio selection and quantum state learning.

CMDNet simplifies MAP detection for large systems with probabilistic relaxation.

problem High complexity of MAP detection in large systems.
method Probabilistic Continuous relaxation of discrete variables, iterative CMD algorithm, CMDNet with online optimization.
result CMDNet achieves a promising accuracy-complexity trade-off in MIMO systems.

New algorithm reduces regret in online portfolio and quantum state learning.

problem Efficiently learning portfolios and quantum states online with minimal regret.
method BISONS algorithm for online portfolio selection, SCHRODINGER'S BISONS for quantum states, with polylogarithmic regret.
result First efficient algorithm with polylogarithmic regret for online portfolio selection and quantum states.

Tensor decompositions are powerful tools for large data analytics as they jointly model multiple aspects of data into one framework and enable the discovery of the latent structures and higher-order correlations within the data. One of the most widely studied and used decompositions, especially in data mining and machi…

2018-07-03abs ↗pdf ↗

New framework predicts earnings announcements using press release content, surpassing earnings surprises.

problem Predicting stock returns based on earnings press releases.
method Compared traditional and BERT-based embeddings of press releases, finding content as informative as earnings surprises.
result FinBERT yields highest predictive power for earnings announcement returns.

Hybrid model for online nonlinear prediction using LSTM and soft GBDT.

problem Online nonlinear prediction with manual feature selection and model selection issues.
method End-to-end architecture with LSTM for feature extraction and soft GBDT for regression, jointly optimized.
result Significant performance improvements over conventional methods on real datasets.

Motivated by applications in computational advertising and systems biology, we consider the problem of identifying the best out of several possible soft interventions at a source node VV in an acyclic causal directed graph, to maximize the expected value of a target node YY (located downstream of VV). Our setting im…

2017-01-10abs ↗pdf ↗

Proposes a new online learning strategy for multi-target regression in data streams.

problem Challenges in learning from high-throughput data streams, especially in multi-target regression.
method Extends existing online decision tree learning algorithm to consider inter-target dependencies.
result SST-HT presents superior predictive accuracy compared to state-of-the-art algorithms.

In this article, we propose the Coopetititve Soft Gating Ensemble or CSGE for general machine learning tasks and interwoven systems. The goal of machine learning is to create models that generalize well for unknown datasets. Often, however, the problems are too complex to be solved with a single model, so several model…

2018-07-03abs ↗pdf ↗

KT models struggle with student concept drift, but BKT remains the most stable.

problem Impact of student concept drift on KT models.
method Applied four KT models to five academic years of data.
result KT models generally degrade in performance with concept drift, BKT remains stable.

The aim of process discovery, originating from the area of process mining, is to discover a process model based on business process execution data. A majority of process discovery techniques relies on an event log as an input. An event log is a static source of historical data capturing the execution of a business proc…

2017-04-25abs ↗pdf ↗

Employers actively look for talents having not only specific hard skills but also various soft skills. To analyze the soft skill demands on the job market, it is important to be able to detect soft skill phrases from job advertisements automatically. However, a naive matching of soft skill phrases can lead to false pos…

2018-07-20abs ↗pdf ↗