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

105209314418 · Jun 202019922001200920172026
48 results for adaptive law-based transformation

ALT improves TSC by capturing complex patterns in time series data.

problem Challenges in traditional TSC methods with time series complexity and variability.
method ALT incorporates variable-length shifted time windows to enhance LLT for better feature representation.
result ALT achieves state-of-the-art performance with few hyperparameters.

Agents acting in the natural world aim at selecting appropriate actions based on noisy and partial sensory observations. Many behaviors leading to decision mak- ing and action selection in a closed loop setting are naturally phrased within a control theoretic framework. Within the framework of optimal Control Theory, o…

2014-06-27abs ↗pdf ↗

New methods predict neural network quality without access to training data.

problem Predicting neural network quality without access to training or testing data.
method Meta-analysis of pretrained models using norm and power law based metrics.
result Power law based metrics can better distinguish well-trained from poorly-trained models.

A new clustering framework using fixed points for data analysis.

problem Lack of unified understanding and application of clustering algorithms in data analysis.
method Restated model-based clustering using fixed point theory, iteratively constructing contraction maps to find cluster centers.
result Unified clustering framework reveals convergence mechanisms and interconnections among clustering algorithms.

ADAPT improves robustness of Vision Transformers without full model fine-tuning.

problem Vulnerability of Vision Transformers to adversarial attacks.
method Parameter-efficient prompt tuning with ADAPT framework for adaptive adversarial training.
result ADAPT achieves robust accuracy of ~40% w.r.t. SOTA methods using only ~1% of the parameters.

New Hermite approximations accelerate convergence with adaptive coordinate transformations.

problem Accelerating convergence of spectral approximations for Hermite expansions.
method Using normalizing flows for adaptive coordinate transformations and deriving error estimates.
result Error estimates for Hermite expansions under adaptive coordinate transformations.

Suppose ΓΓ is a discrete group, and αZ3(BΓ;A)α\in Z^3(BΓ;A), with AA an abelian group. Given a representation ρ:π1(M)Γρ:π_1(M)\toΓ, with MM a closed 3-manifold, put F(M,ρ)=(Bρ)[α],[M]F(M,ρ)=\langle(Bρ)^\ast[α],[M]\rangle, where Bρ:MBΓBρ:M\to BΓ is a continuous map inducing ρρ which is unique up to homotopy, and $\langle-,-\rangle:H^3(M;A)\times H_…

2019-02-20abs ↗pdf ↗

Vision transformers benefit from non-smooth components in adaptation.

problem Understanding the role of non-smoothness in vision transformer adaptation.
method Theoretical analysis and extensive experiments on large-scale vision transformers.
result High plasticity of attention modules and feedforward layers leads to better finetuning performance.

We analyze the computational limits of LoRA for transformer models using fine-grained complexity theory.

problem Computational efficiency of LoRA fine-tuning for transformer models.
method Fine-grained complexity theory, identifying phase transitions, almost linear algorithms.
result Existence of almost linear algorithms for LoRA adaptation based on specific norms.

This paper improves test-time adaptation for distribution shifts using confidence maximization and input transformation.

problem Improving deep networks' performance on data shifted from the training distribution.
method Proposes a novel loss function combining confidence maximization and batch-wise entropy maximization with an input transformation module.
result Significantly improves robustness of pretrained networks to corruptions on benchmarks like ImageNet-C.

LOFT separates subspace rotation and transformation for orthogonal fine-tuning.

problem Conflating subspace rotation and transformation in orthogonal fine-tuning.
method LOFT explicitly separates subspace rotation and transformation, using task-aware support selection.
result LOFT recovers principal-subspace orthogonal adaptation and improves efficiency-performance trade-off.

In many state-of-the-art compression systems, signal transformation is an integral part of the encoding and decoding process, where transforms provide compact representations for the signals of interest. This paper introduces a class of transforms called graph-based transforms (GBTs) for video compression, and proposes…

2019-09-03abs ↗pdf ↗

ARM improves multivariate time series forecasting by better capturing series-wise relationships.

problem Challenges in handling complex temporal-contextual relationships in multivariate time series forecasting.
method ARM is an enhanced multivariate LTSF architecture that employs Adaptive Univariate Effect Learning, Random Dropping, and Multi-kernel Local Smoothing.
result ARM outperforms vanilla Transformers on multiple benchmarks without significantly increasing computational costs.

Study aggregation of statistical evidence under unknown dependence using group-invariance.

problem Aggregating statistical evidence under unknown and complex dependence structures.
method Develops a framework using group-invariance and permutation-based constructions to aggregate evidence across transformed datasets.
result Shows uniform improvement in critical values for single-batch aggregation over deterministic calibrations, adapting to unknown dependence structures.

Attention mechanisms have become ubiquitous in NLP. Recent architectures, notably the Transformer, learn powerful context-aware word representations through layered, multi-headed attention. The multiple heads learn diverse types of word relationships. However, with standard softmax attention, all attention heads are de…

2019-08-30abs ↗pdf ↗

Few-shot domain adaptation improves autoencoder performance in changing wireless channels.

problem Frequent retraining of autoencoder for low decoding error rate in changing channel conditions is impractical.
method Uses Gaussian mixture density network and class and component-conditional affine transformations for few-shot adaptation.
result Effective adaptation using very small number of target domain samples, improving performance in real mmWave setups.

New method adapts neural networks without losing prior knowledge.

problem Understanding and enabling flexible adaptation of neural networks.
method Differential geometry framework, functionally invariant paths (FIP).
result Achieves comparable state-of-the-art performance on continual learning and sparsification tasks.

Transformer learns to infer partial MDPs for efficient in-context adaptation and exploration.

problem Efficiently adapt and explore in-context without gradient-based updates.
method Uses a transformer to learn inference from training tasks, considering hypothesis space of partial models.
result Adaptation speed and exploration-exploitation balance approach those of an exact posterior sampling oracle.

New method makes CP intervals locally adaptive using trainable transformations.

problem Making Conformal Prediction intervals locally adaptive.
method Defining a trainable change of variables φX(A)φ_X(A) that depends on object attributes XX.
result Locally adaptive prediction intervals with guaranteed marginal validity and variable sizes.

The paper addresses risk sharing and variability measures among agents with general risk preferences.

problem Risk sharing and variability measures among agents with general risk preferences.
method Characterizes Pareto-optimal allocations using Gini deviation, mean-median deviation, and inter-quantile difference as variability measures.
result Optimal allocations are not comonotonic and feature a mixture of pairwise counter-monotonic structures.

Adaptive framework predicts stock prices better during volatile periods.

problem Inability of standard prediction models to handle regime-dependent stock market behavior.
method Autoencoder-Gated Dual Node Transformers with Reinforcement Learning Control.
result 0.59% MAPE with adaptive system, compared to 0.80% for baseline.

How can deep learning systems flexibly reuse their knowledge? Toward this goal, we propose a new class of challenges, and a class of architectures that can solve them. The challenges are meta-mappings, which involve systematically transforming task behaviors to adapt to new tasks zero-shot. The key to achieving these c…

2019-05-23abs ↗pdf ↗

Study proposes adaptive RL for dynamic portfolio optimization.

problem Traditional portfolio optimization models fail to adapt to regime shifts.
method Regime-aware reinforcement learning framework with hybrid observations and constrained reward functions.
result Transformer PPO achieves highest risk-adjusted returns, while LSTM variants offer a good balance.

SPARTAN learns sparse interaction graphs between objects in scenes.

problem Capturing structured interactions between entities in complex settings remains challenging.
method SPARTAN is a Transformer-based world model that learns sparse, context-dependent interaction graphs through sparsity regularization on attention patterns.
result SPARTAN achieves significantly improved few-shot adaptation to dynamics changes and robustness against distractors.

Transformer pretraining yields strong EB performance without explicit adaptation.

problem Empirical Bayes problems with unknown test distributions.
method Indirect analysis of pretrained transformer's performance under universal priors.
result Near-optimal regret bound of O~(1n)\widetilde{O}(\frac{1}{n}) for arbitrary test distributions.

New framework transforms labeled datasets for various machine learning tasks.

problem Lack of principled methods to transform labeled datasets.
method Wasserstein gradient flows in probability space for optimization of data-generating distributions.
result Framework can impose constraints, adapt for transfer learning, or re-purpose models.

Transformer adapts to graphs with adaptive attention and auto-regressive decoding.

problem Transformers struggle with graph data due to non-sequential nature.
method Proposes GRAT, a Transformer variant with adaptive attention and auto-regressive decoding.
result GRAT achieves state-of-the-art performance on molecule property predictions and generation tasks.

A multi-step framework tackles online unsupervised domain adaptation with novel mean-target subspace computation.

problem Online unsupervised domain adaptation with unlabelled target data arriving sequentially.
method Multi-step framework with a novel mean-target subspace computation and temporal coherency consideration.
result Improved performance over previous approaches on four datasets.

SplitWise enhances stepwise regression by adaptively encoding numeric predictors into binary features.

problem Capturing nonlinear relationships in regression models without sacrificing interpretability.
method Adaptive encoding of numeric predictors into binary features using shallow decision trees, assessed by AIC or BIC.
result Consistently produces more parsimonious and generalizable models than traditional techniques.

We use the dressing method to construct transformations of constrained Willmore surfaces in arbitrary codimension. An adaptation of the Terng--Uhlenbeck theory of dressing by simple factors to this context leads us to define Bäcklund transforms of these surfaces for which we prove Bianchi permutability. Specialising to…

2013-07-08abs ↗pdf ↗

This study proposes a trainable adaptive window switching (AWS) method and apply it to a deep-neural-network (DNN) for speech enhancement in the modified discrete cosine transform domain. Time-frequency (T-F) mask processing in the short-time Fourier transform (STFT)-domain is a typical speech enhancement method. To re…

2018-11-05abs ↗pdf ↗

Adaptive TFTs improve cryptocurrency price prediction accuracy.

problem Precise short-term price prediction in volatile cryptocurrency markets.
method Dynamic subseries lengths and pattern-based categorization.
result Significantly outperforms baseline models in prediction accuracy and profitability.