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

120240359479 · Jun 202019922001200920182026
48 results for native spaces

Constructs native Banach spaces for spline operators, enabling precise function reproduction.

problem Developing native Banach spaces for spline-admissible operators.
method Systematic construction involving test functions and completion processes.
result Native spaces ensure precise function reproduction with arbitrary precision.

Representation costs in data science: Unifying function-space views of parametric methods

problem Analyzing representation costs of parametric data-fitting methods
method Developing a general framework for analyzing representation costs through parameter-space regularizers
result Proving that many natural results hold in this abstract setting, including representer theorems for parametric methods on their native spaces

This paper presents a fast Bayesian filtering technique for state estimation.

problem Bottleneck in Bayesian inference for state estimation from noisy sensor data.
method Processor-native uncertainty tracking for uncertainty propagation and inference.
result Deterministic approximate filtering with up to 805x speedup and competitive accuracy.

We consider the role of unobservables, such as differences in search frictions, reservation wages, and productivities for the explanation of wage differentials between migrants and natives. We disentangle these by estimating an empirical general equilibrium search model with on-the-job search due to Bontemps, Robin, an…

2013-06-07abs ↗pdf ↗

HAMD optimizes cubic portfolios without quadratization, achieving better results.

problem Optimizing higher-order portfolio models with reduced distortion.
method Hybrid pipeline combining continuous Hamiltonian search, cardinality-preserving projection, and iterated local search.
result HAMD achieves significantly lower native cubic objective values than classical heuristics.

We construct a number of sculptures, each based on a geometric design native to the three-dimensional sphere. Using stereographic projection we transfer the design from the three-sphere to ordinary Euclidean space. All of the sculptures are then fabricated by the 3D printing service Shapeways.

2012-04-23abs ↗pdf ↗

The paper aims to explore the impacts of bi-demographic structure on the current account and growth. Using a SVAR modeling, we track the dynamic impacts between these underlying variables. New insights have been developed about the dynamic interrelation between population growth, current account and economic growth. Th…

2018-03-29abs ↗pdf ↗

Bayesian Active Learning improves protein docking accuracy and uncertainty quantification.

problem Uncertainty quantification in protein docking optimization.
method Bayesian Active Learning (BAL) for optimization and uncertainty quantification of protein docking.
result BAL significantly improves docking accuracy and provides tight confidence intervals.

Proposes hybrid reinforcement learning for both discrete and continuous control problems.

problem Real-world control problems involving both discrete and continuous decision variables.
method Solves hybrid problems by optimizing for discrete and continuous actions simultaneously.
result Efficiently solves hybrid reinforcement learning problems and improves upon expert heuristics.

Approximating non-linear kernels using feature maps has gained a lot of interest in recent years due to applications in reducing training and testing times of SVM classifiers and other kernel based learning algorithms. We extend this line of work and present low distortion embeddings for dot product kernels into linear…

2012-01-31abs ↗pdf ↗

Proposes a multi-view VAE for imputing missing data from correlated sources.

problem Imputing missing data from multi-view sources with latent space correlation.
method Enforces a joint prior with latent space correlation between VAEs trained on each view.
result More strongly correlated latent spaces are uncovered, enabling effective imputation.

New method uncovers small but significant local activities in time-series data.

problem Reconstructing small but important local activities in time-series data.
method Neural state-space models with latent causal-effect disentanglement.
result Demonstrated proof-of-concept on reconstructing ectopic foci in cardiac electrical propagation.

FinRL-X unifies trading components for AI and rule-based strategies.

problem Inconsistent between research and live deployment in trading platforms.
method Modular architecture integrating data processing, strategy construction, backtesting, and execution.
result Unified protocol supports AI and rule-based trading components without altering execution.

LoBoost improves local conformal prediction for gradient-boosted trees without extra data splits.

problem Quantifying uncertainty in gradient-boosted tree predictions.
method Model-native local conformal prediction using leaf structure.
result Competitive interval quality and improved test MSE with large calibration speedups.

Framework extends neural operators to handle functions outside training set.

problem Robust handling of functions beyond the training set.
method Kernel approximation techniques and Reproducing Kernel Hilbert Spaces (RKHSs) theory.
result Theoretical framework and empirical validation for reliable function extension.

This work reduces the dimensionality of text data using SVD, improving performance and computational efficiency.

problem High-dimensional input spaces in text classification lead to excessive parameter count and computational infeasibility.
method Singular Value Decomposition (SVD) is applied to transform the input space into a lower-dimensional latent space.
result Neural networks trained on the lower-dimensional latent space achieve comparable or better performance with reduced computational complexity.

Proposes a novel algorithm for multi-objective reinforcement learning.

problem Challenges in setting numerical preferences for objectives in different units and scales.
method Learn action distributions for each objective and use supervised learning to fit a parametric policy.
result Demonstrates effectiveness on robotics tasks, allowing tracing out the space of nondominated solutions.

Generative AI agents improve ERP systems by automating complex financial tasks.

problem Static, rule-based workflows limit adaptability and intelligence in ERP systems.
method Introducing Generative Business Process AI Agents (GBPAs) that integrate generative AI with business process modeling and multi-agent orchestration.
result GBPAs achieve up to 40% reduction in processing time and 94% drop in error rate.

MultiVerse uses importance sampling for efficient causal reasoning in probabilistic programming.

problem Efficient causal reasoning in probabilistic models, especially counterfactual inference.
method Native implementation of importance sampling in probabilistic programming, optimizing inference through query structure.
result Significant optimisation of inference process through careful design choices and query structure consideration.

SOC-ICNN expands neural network representational capacity by using conic optimization.

problem Restrictive representational capacity of ReLU-based ICNNs.
method Proposes SOC-ICNN architecture that uses Second-Order Cone Programming.
result SOC-ICNN strictly expands representational space without increasing complexity.

This paper optimizes binary linear classifiers by tuning their weight vectors.

problem Optimizing the weight vector of binary linear classifiers for better performance.
method Parameterization of the discriminant through a scalar to control trade-offs between informative and noisy terms.
result Weight vector tuning compensates for non-optimal native hyperparameters, improving classification performance.

We consider the question of estimating a solution to a system of equations that involve convex nonlinearities, a problem that is common in machine learning and signal processing. Because of these nonlinearities, conventional estimators based on empirical risk minimization generally involve solving a non-convex optimiza…

2017-02-17abs ↗pdf ↗