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

4487131174 · Jun 202019922001200920182026
48 results for flexibly stable

Groups of importance in group theory have flexible stability properties.

problem Stability and flexibility of groups in geometric and combinatorial group theory.
method Establishing Kirchberg's Local Lifting Property and Lubotzky--Shalom's Property FD for specific groups.
result Groups like 33-manifold groups, limit groups, and certain one-relator groups are very flexibly stable.

Novel neural GP kernels learn stable, flexible covariance structures.

problem Scalable and flexible covariance kernels for Gaussian processes.
method Directly learn kriging coefficients and conditional standard deviations using deep neural architectures exploiting permutation-equivariant structure.
result Improved training stability and data efficiency with expressive, non-stationary kernels.

A new method learns stable, temporally coherent features in point clouds.

problem Flickering and halo structures in inferred solutions for time-varying point clouds.
method Proposes a novel temporal loss function and super-resolution method.
result Demonstrates flexibility and effectiveness on large, deforming point sets.

We consider the problem of impulse response estimation of stable linear single-input single-output systems. It is a well-studied problem where flexible non-parametric models recently offered a leap in performance compared to the classical finite-dimensional model structures. Inspired by this development and the success…

2018-01-25abs ↗pdf ↗

In this paper we introduce a new parametric distribution, the Mixed Tempered Stable. It has the same structure of the Normal Variance Mean Mixtures but the normality assumption leaves place to a semi-heavy tailed distribution. We show that, by choosing appropriately the parameters of the distribution and under the conc…

2014-05-29abs ↗pdf ↗

We develop a flexible framework for low-rank matrix estimation that allows us to transform noise models into regularization schemes via a simple bootstrap algorithm. Effectively, our procedure seeks an autoencoding basis for the observed matrix that is stable with respect to the specified noise model; we call the resul…

2014-10-30abs ↗pdf ↗

Proposes a method to learn stable invariant sets in dynamical systems.

problem Learning stable invariant sets in general dynamical systems.
method Generalizes Manek and Kolter's approach by introducing projection onto latent space shapes and using invertible neural networks.
result Validates the method and shows its usefulness for long-term prediction.

Stable Hadamard Memory improves reinforcement learning by efficiently managing memory.

problem Memory models struggle in partially observable reinforcement learning environments.
method Introduces a novel memory model using the Hadamard product for efficient memory management and updates.
result Significantly outperforms state-of-the-art memory-based methods on challenging benchmarks.

Unified framework for analyzing stable learning algorithms across different dataset shifts.

problem Analyzing and comparing stability of learning algorithms across various dataset shifts.
method Causal graphical representation to express dataset shifts and a hierarchy of operators to disable shift-causing edges.
result Established conditions for optimal performance and derived new algorithms for finding stable distributions.

DLPM replaces Gaussian noise with α-stable noise in DDPM, improving data distribution coverage and robustness.

problem Handling mode collapse and class imbalance in datasets with heavy-tailed noise.
method Extending DDPM to use α-stable noise, simplifying the process with elementary proof techniques.
result DLPM yields better coverage of data distribution tails, improved robustness to unbalanced datasets, and faster computation times.

Proposes flexible spatial models for better understanding spatial heterogeneity.

problem Poor characterisation of spatial heterogeneity in conventional models.
method Spatial Bayesian Neural Networks (SBNNs) incorporating a spatial embedding layer and possibly spatially-varying parameters.
result SBNNs better match the finite-dimensional distribution of target spatial processes.

Mixture modelling using elliptical distributions promises enhanced robustness, flexibility and stability over the widely employed Gaussian mixture model (GMM). However, existing studies based on the elliptical mixture model (EMM) are restricted to several specific types of elliptical probability density functions, whic…

2018-05-21abs ↗pdf ↗

This paper presents a fast and robust algorithm for trend filtering, a recently developed nonparametric regression tool. It has been shown that, for estimating functions whose derivatives are of bounded variation, trend filtering achieves the minimax optimal error rate, while other popular methods like smoothing spline…

2014-06-09abs ↗pdf ↗

Integral foliated simplicial volume is a version of simplicial volume combining the rigidity of integral coefficients with the flexibility of measure spaces. In this article, using the language of measure equivalence of groups we prove a proportionality principle for integral foliated simplicial volume for aspherical m…

2014-03-18abs ↗pdf ↗

We solve the paradox of score-based methods by minimizing path variance.

problem Score-based methods are path-dependent, leading to inaccurate and unstable estimators.
method Propose MVP Principle to minimize path variance, derive closed-form expression, and use flexible Kumaraswamy Mixture Model.
result Establishes new state-of-the-art results on challenging benchmarks.

This work tackles exploding inverses in INNs, revealing and mitigating their numerical non-invertibility.

problem Exploding inverses in INNs cause numerical non-invertibility, leading to failures in various tasks.
method Derived bi-Lipschitz properties of INN building blocks, proposed regularizers for local invertibility, and stable INN designs for global invertibility.
result Bi-Lipschitz properties and stable INN designs are crucial for addressing numerical non-invertibility.

We consider the problem of learning a Gaussian variational approximation to the posterior distribution for a high-dimensional parameter, where we impose sparsity in the precision matrix to reflect appropriate conditional independence structure in the model. Incorporating sparsity in the precision matrix allows the Gaus…

2016-05-18abs ↗pdf ↗

Spread options are a fundamental class of derivative contract written on multiple assets, and are widely used in a range of financial markets. There is a long history of approximation methods for computing such products, but as yet there is no preferred approach that is accurate, efficient and flexible enough to apply …

2009-02-20abs ↗pdf ↗

This work improves policy-based training by proposing an evaluation balance objective for GFlowNets.

problem Reliable estimation of policy divergence under directed acyclic graphs remains challenging.
method Proposes an evaluation balance objective over partial episodes to measure policy divergence and improve policy-based training reliability.
result Evaluation balance strengthens policy-based training reliability and broadens its flexibility.

pmsims R package uses Gaussian process for flexible sample size estimation in clinical models.

problem Determining adequate sample size for clinical prediction models.
method Simulation-based Gaussian process search for flexible sample size estimation.
result Gaussian process-based method produces more stable sample size estimates, especially in challenging settings.

A framework uses preprocessing to improve psychiatric questionnaire predictions while maintaining interpretability.

problem Weak predictive accuracy and limited interpretability of psychiatric questionnaires.
method Two-stage method: stable preprocessing followed by a linear mapping.
result REFINE outperforms other interpretable approaches in psychiatric and non-psychiatric prediction tasks.

The TensorFlow Distributions library implements a vision of probability theory adapted to the modern deep-learning paradigm of end-to-end differentiable computation. Building on two basic abstractions, it offers flexible building blocks for probabilistic computation. Distributions provide fast, numerically stable metho…

2017-11-28abs ↗pdf ↗

SDQL uses modular deep Q networks to efficiently learn multi-stage optimal control tasks.

problem Training complex deep reinforcement learning models for multi-stage control tasks is inefficient and unstable.
method Stacked Deep Q Learning (SDQL) with modular Q networks and backward training.
result SDQL efficiently learns optimal control policies for multi-stage tasks with high-dimensional state and action spaces.

New framework quantifies variable importance across all good models and is stable across data distribution.

problem Conflicting variable importance conclusions from different models trained on the same data.
method Proposes a new variable importance framework that considers all good models and is stable across data distribution.
result Framework accurately estimates true variable importance and recovers rankings for complex setups.

Dynamic risk factor model improves portfolio performance in high dimensions.

problem Dynamic portfolio allocation in high-dimensional financial markets.
method Time-varying sparsity on factor loadings, sequential learning of parameters and volatilities.
result Significant portfolio performance improvements and higher utility gains.

Proposes a new Q-learning method for survival outcomes in clinical trials.

problem Incomplete follow-up data and nonlinear covariate effects in clinical trials.
method Combines Buckley-James boosting with flexible base learners for estimating optimal treatment regimes.
result Improves treatment decision accuracy and stability in longitudinal clinical trials.

Study combines SEM, OLS, and DML for robustness checks in survey-based research.

problem Stability of SEM findings under alternative estimation frameworks.
method Staged robustness analysis framework connecting SEM, OLS, and DML.
result Identifies stable and unstable relationships across SEM, OLS, and DML checks.

Proposes a new method to optimize graph neural network architectures on heterogeneous information networks.

problem Weaknesses in instability and inflexibility of existing graph neural architecture search methods.
method Partial Message Meta Multigraph search (PMMM) using a differentiable framework to search for a meaningful meta multigraph.
result Significantly more stable and effective than state-of-the-art heterogeneous GNNs.

A new method for faster prediction in distributed Gaussian processes.

problem Inefficient aggregation of distributed Gaussian processes with correlations.
method Proposes a novel approach for aggregated prediction in distributed GPs that incorporates correlations among experts.
result Results in more stable predictions in less time compared to state-of-the-art methods.

In this paper we define and study flexible links and flexible isotopy in projective space. Flexible links are meant to capture the topological properties of real algebraic links. We classify all flexible links up to flexible isotopy using Ekholms interpretation of Viros encomplexed writhe.

2012-12-15abs ↗pdf ↗

The authors characterize flexibility in power and energy markets considering time, spatiality, resource, and risk.

problem Evaluating and maximizing flexibility in power systems and markets.
method Characterization of flexibility dimensions (time, spatiality, resource, risk) and their interrelations with flexibility assets, products, and services.
result Flexibility should be evaluated based on multiple dimensions for efficient power systems and markets.

We propose a network structure discovery model for continuous observations that generalizes linear causal models by incorporating a Gaussian process (GP) prior on a network-independent component, and random sparsity and weight matrices as the network-dependent parameters. This approach provides flexible modeling of net…

2017-02-27abs ↗pdf ↗