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,695 papers · 148 categories

Trend · papers per month

1223 · Jun 201919922001200920172026
39 results for AdaS

Reinforce-Ada improves RL for language models by adaptively sampling difficult prompts.

problem Signal loss in RL for large language models due to undersampling.
method Adaptive sampling based on a non-linear RL objective, optimizing prompt difficulty weighting.
result Reinforce-Ada significantly outperforms uniform sampling, recovering lost signals and accelerating convergence.

Neural networks that are based on unfolding of an iterative solver, such as LISTA (learned iterative soft threshold algorithm), are widely used due to their accelerated performance. Nevertheless, as opposed to non-learned solvers, these networks are trained on a certain dictionary, and therefore they are inapplicable f…

2020-01-23abs ↗pdf ↗

Two algorithms improve federated learning efficiency and resilience.

problem Scalability issues in federated learning due to communication, privacy, and Byzantine attacks.
method Proposes two algorithms, Ada-StoSign and ββ-StoSign, that compress gradients into bit vectors to reduce communication.
result Ada-StoSign converges with a rate of O(logT/T+1/M)O(\log T/\sqrt{T} + 1/\sqrt{M}) and outperforms existing methods.

Adaptive stochastic gradient methods such as AdaGrad have gained popularity in particular for training deep neural networks. The most commonly used and studied variant maintains a diagonal matrix approximation to second order information by accumulating past gradients which are used to tune the step size adaptively. In…

2016-11-21abs ↗pdf ↗

Proposes Ada-Sit method for mortality prediction of rare diseases.

problem Data insufficiency and clinical diversity of rare diseases make mortality prediction hard.
method Initialization-sharing multi-task learning method (Ada-Sit) for fast adaptation to similar tasks.
result Experimental results show the proposed model is effective for mortality prediction of diverse rare diseases.

In order to classify linearly non-separable data, neurons are typically organized into multi-layer neural networks that are equipped with at least one hidden layer. Inspired by some recent discoveries in neuroscience, we propose a new model of artificial neuron along with a novel activation function enabling the learni…

2020-02-02abs ↗pdf ↗

In the absence of sufficient data variation (e.g., scanner and protocol variability) in annotated data, deep neural networks (DNNs) tend to overfit during training. As a result, their performance is significantly lower on data from unseen sources compared to the performance on data from the same source as the training …

2019-08-16abs ↗pdf ↗

Ada-BKB optimizes black-box functions on continuous domains with adaptive discretization.

problem Optimizing functions with continuous domains using Gaussian process optimization.
method Adaptive discretization of the function domain to avoid non-convex optimization costs.
result Ada-BKB algorithm runs in O(T2dexteff2)O(T^2 d_ ext{eff}^2), significantly faster than existing methods.

Accurate diagnosis of Alzheimer's Disease (AD) entails clinical evaluation of multiple cognition metrics and biomarkers. Metrics such as the Alzheimer's Disease Assessment Scale - Cognitive test (ADAS-cog) comprise multiple subscores that quantify different aspects of a patient's cognitive state such as learning, memor…

2017-06-26abs ↗pdf ↗

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.

This paper certifies cluster assignments from sum-of-norms clustering algorithms.

problem Certifying the correct cluster assignments from approximate solutions of sum-of-norms clustering.
method Presented a clustering test that identifies and certifies the correct cluster assignment from an approximate solution.
result The correct cluster assignment is guaranteed to be certified by a primal-dual path following algorithm after sufficient iterations.

Yarbus' claim to decode the observer's task from eye movements has received mixed reactions. In this paper, we have supported the hypothesis that it is possible to decode the task. We conducted an exploratory analysis on the dataset by projecting features and data points into a scatter plot to visualize the nuance prop…

2019-07-29abs ↗pdf ↗

New RL algorithm tackles nonstationary MDPs with linear approximations and varying rewards.

problem Nonstationary reinforcement learning with evolving reward and state transition functions.
method Developed a new algorithm LSVI-UCB-Restart with periodic restart, and parameter-free Ada-LSVI-UCB-Restart for unknown variation budgets.
result First minimax dynamic regret lower bound for nonstationary linear MDPs and linear MDPs lower bound.

Stochastic gradient decent~(SGD) and its variants, including some accelerated variants, have become popular for training in machine learning. However, in all existing SGD and its variants, the sample size in each iteration~(epoch) of training is the same as the size of the full training set. In this paper, we propose a…

2019-06-11abs ↗pdf ↗

Adversarial training is a useful approach to promote the learning of transferable representations across the source and target domains, which has been widely applied for domain adaptation (DA) tasks based on deep neural networks. Until very recently, existing adversarial domain adaptation (ADA) methods ignore the usefu…

2019-05-28abs ↗pdf ↗

Research uses SWT and BDLSTM to forecast stock and oil prices amid COVID-19.

problem Impact of COVID-19 on stock and oil prices forecasting.
method Integrates Stationary Wavelet Transform and Bidirectional Long Short-Term Memory networks.
result BDLSTM+WT-ADA achieved satisfactory results in Crude Oil price forecasting.

Graded Transformers embed algebraic structure in neural networks through graded transformations.

problem Efficiently modeling hierarchical and structured data in neural networks.
method Introduces Linearly Graded Transformer (LGT) and Exponentially Graded Transformer (EGT) with graded scaling operators.
result Establishes rigorous guarantees and improved efficiency for structured data.

Long-term lane change prediction model predicts maneuvers with 75% accuracy.

problem Predicting long-term lane changes for safer autonomous driving.
method Introduced three models: logistic regression, MLP, and RNN. Used NGSIM dataset with new labeling scheme.
result Developed model predicts 75% of lane changes with an average advanced time of 8.05 seconds.

Study benchmarks cryptocurrency risk using GBM, revealing Lognormal limitations.

problem Tackles limitations of Lognormal assumption in modeling cryptocurrency volatility and VaR.
method Applies Geometric Brownian Motion (GBM) with Maximum Likelihood Estimation and correlated Monte Carlo Simulation.
result Observed limitations of Lognormal assumption in cryptocurrency volatility and VaR calculations.

New findings show many popular bandit algorithms are unstable, contradicting minimax optimality.

problem Challenges in statistical inference from bandit algorithms due to adaptive, non-i.i.d. nature.
method Analysis of stability properties of optimism-based bandit algorithms.
result Widely used minimax-optimal UCB-style algorithms are unstable.