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.

168,742 papers · 148 categories

Trend · papers per month

0.3%0.5%0.8%0.3% · May 201619922001200920172026
31 results for SST

Graph neural networks (GNNs) are designed for semi-supervised node classification on graphs where only a subset of nodes have class labels. However, under extreme cases when very few labels are available (e.g., 1 labeled node per class), GNNs suffer from severe performance degradation. Specifically, we observe that exi…

2019-10-07abs ↗pdf ↗

Deep learning detects sleep state fluctuations in neonates from single EEG channel.

problem Monitoring sleep state fluctuations in neonatal intensive care units.
method Deep learning-based algorithm trained on 53 EEG recordings, validated on 30 polysomnography recordings.
result High accuracy (90%) in detecting quiet sleep states from single EEG channel, generalizing well to external dataset.

The study forecasts water quality from satellite data using machine learning.

problem Predicting future water quality from satellite data for coastal regions.
method Decomposed time series into components and used machine learning models (SARIMA, regression, neural network).
result Regression and neural network models are best at predicting Chl-a, SARIMA model best at FLH and SST.

Study compares machine learning algorithms for predicting SST in the Great Barrier Reef.

problem Predicting sea surface temperature in the Great Barrier Reef region.
method Ridge regression, LASSO, Random Forest, and Extreme Gradient Boosting (XGBoost) algorithms were evaluated.
result XGBoost significantly outperforms other algorithms in terms of predictive accuracy and Kullback-Leibler Divergence.

In this paper, a frequency coefficient based on the Sen-Shorrocks-Thon (SST) poverty index notion is proposed. The clustering SST index can be used as the method for determination of the connection between similar neighbor sub-clusters. Consequently, connections can reveal existence of natural homogeneous. Through esti…

2017-10-19abs ↗pdf ↗

This article presents a stochastic framework to quantify the biometric risk of an insurance portfolio in solvency regimes such as Solvency II or the Swiss Solvency Test (SST). The main difficulty in this context constitutes in the proper representation of long term risks in the profit-loss distribution over a one year …

2019-10-09abs ↗pdf ↗

Study on tracking preference shifts in dueling bandits problems.

problem Tracking significant preference shifts in dueling bandits problems.
method Analysis of dueling bandits with distribution shifts, focusing on significant shifts (Suk and Kpotufe, 2022).
result Design of adaptive algorithms with O(KildeLT)O(\sqrt{K ilde{L}T}) dynamic regret for certain preference distribution classes.

Exact pairwise ranking is achievable but not possible under noisy comparisons.

problem Recovering the exact rank of items from noisy pairwise comparisons.
method Information-theoretic upper and lower bounds using the SST model and combinatorial arguments.
result Sharp information-theoretic bounds match in the parametric limit and outperform previous methods.

This study predicts parking availability using multi-source data and a self-supervised learning enhanced transformer.

problem Accurate parking availability prediction to support urban planning and management.
method Proposes SST-iTransformer, a self-supervised learning enhanced spatio-temporal inverted transformer, integrating multi-source data.
result SST-iTransformer achieves state-of-the-art performance in parking availability prediction.

Framework for realistic insurance liability valuation.

problem Economic realism in insurance liability valuation.
method Replication approach of no-arbitrage theory, considering capital and fulfillment conditions.
result Identifies conditions for market price recovery and extends production for insolvency.

One of the current challenges in machine learning is how to deal with data coming at increasing rates in data streams. New predictive learning strategies are needed to cope with the high throughput data and concept drift. One of the data stream mining tasks where new learning strategies are needed is multi-target regre…

2019-03-29abs ↗pdf ↗

The paper tackles optimal level set estimation in crowdsourcing and tournaments.

problem Deciphering small entries in a partially observed matrix of expert correctness.
method Constructs an efficient polynomial-time algorithm for recovering level sets up to a precision.
result The algorithm is minimax optimal for the classification problem, contrasting with existing literature.

Understanding local currents in the North Atlantic region of the ocean is a key part of modelling heat transfer and global climate patterns. Satellites provide a surface signature of the temperature of the ocean with a high horizontal resolution while in situ autonomous probes supply high vertical resolution, but horiz…

2019-10-18abs ↗pdf ↗

Charmer improves character-level adversarial attacks for language models.

problem Efficiency and effectiveness of character-level adversarial attacks for language models.
method Query-based adversarial attack method that maintains semantic similarity.
result Charmer achieves high attack success rate and similar adversarial examples.

Motivated by applications in recommender systems, web search, social choice and crowdsourcing, we consider the problem of identifying the set of top KK items from noisy pairwise comparisons. In our setting, we are non-actively given rr pairwise comparisons between each pair of nn items, where each comparison has noi…

2016-05-12abs ↗pdf ↗

Parsimonious Dynamic Mode Decomposition selects sparse modes robustly.

problem Manual tuning of sparsity parameters in traditional DMD.
method Time-delay embedding and Orthogonal Matching Pursuit.
result Autonomously determines optimally sparse subset of modes.

New margin-based regularization and selective sampling improve deep neural network performance.

problem Improving deep neural network performance on various classification tasks.
method Multi-margin regularization (MMR) and minimal margin score (MMS) for selective sampling.
result Improved results on multiple classification tasks across domains.

New algorithm B++&C improves hierarchical clustering on large deep embedding datasets.

problem Scaling up hierarchical clustering to massive datasets of deep embeddings.
method Proposes B++&C algorithm for practical hierarchical clustering, introduces B2SAT&C for theoretical approximation.
result Achieves 5%/20% improvement on MW/CKMM objectives compared to classic methods.

The paper assesses text classification robustness through maximal safe radius computation.

problem Vulnerability of neural network models to small input modifications.
method Maximal safe radius computation, Monte Carlo Tree Search, syntactic filtering, linear bounding techniques.
result Approximation methods for computing upper and lower bounds of maximal safe radius.

Proposes FIPO-BC for efficient online calibration of complex models.

problem Efficiently calibrating computationally expensive models with large datasets.
method Fixed inducing points online Bayesian calibration (FIPO-BC) algorithm.
result FIPO-BC is at least ten times faster than standard methods and enables online updates.

The paper designs tests for comparing ranked preference data and finds significant differences.

problem Comparing pairwise comparison and ranking data in various applications.
method Developed two-sample tests for pairwise comparison and ranking data, proving upper and lower bounds.
result Upper and lower bounds show tightness of the proposed tests, and significant differences in preferences were found.

New neural network extracts signal components and their IFs from non-uniform samples.

problem Recovering signal components and their IFs from discrete blind-source data.
method Inspired by theory, deep neural network extends Hilbert transform and synchrosqueezed wavelet transform.
result Neural network resolves inverse problem for non-uniformly sampled data.