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

50101151201 · Jun 202019922001200920172026
48 results for predominant metrics

The study improves bounds on the number of closed geodesics and logarithmic improvements in the Weyl law.

problem Estimating the number of closed geodesics and improving logarithmic bounds in the Weyl law.
method Study of non-degeneracy properties of nearly closed orbits for predominant sets of metrics.
result Logarithmic improvements in the Weyl law and exponential bounds on the number of closed geodesics.

Study uses outer metrics for PDE-constrained shape optimization over diffeomorphism group.

problem Optimizing shapes governed by PDEs over the diffeomorphism group.
method Outer metrics on diffeomorphism group, Riemannian steepest descent method.
result Riemannian approach outperforms other metrics in solving PDE-constrained shape optimization problems.

The author has elsewhere given a complete classification of those compact oriented Einstein 4-manifolds on which the self-dual Weyl curvature is everywhere positive in the direction of some self-dual harmonic 2-form. In this article, similar results are obtained when the self-dual Weyl curvature is everywhere non-negat…

2019-03-03abs ↗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 ↗

New research shows CI in few-shot learning is misleading due to sampling with replacement.

problem Misleading confidence intervals in few-shot learning due to sampling with replacement.
method Comparative analysis of CIs computed with and without replacement.
result Significant underestimation of CI by the predominant method.

The paper examines statistical properties of IL and LVR in automated market makers.

problem Assessing the performance of automated market makers and their profitability.
method Analysis of random walk properties and statistical integral combined with CFMM mechanics.
result IL and LVR have identical expectation values but different distribution functions for Brownian motion.

Bayesian deep learning improves deep learning's capabilities across diverse settings.

problem Overlooked metrics, tasks, and data types in deep learning.
method Revisits strengths of Bayesian deep learning and addresses challenges.
result Bayesian deep learning can elevate deep learning's capabilities across diverse settings.

The paper tackles inconsistency in removal-based explanations and proposes methods to reduce it.

problem Inconsistency in removal-based explanations.
method Established the Impossible Trinity Theorem and proposed two novel algorithms to minimize interpretation error.
result The proposed methods achieve a substantial reduction in interpretation error, up to 31.8 times lower.

Deep neural networks have frequently been used to directly learn representations useful for a given task from raw input data. In terms of overall performance metrics, machine learning solutions employing deep representations frequently have been reported to greatly outperform those using hand-crafted feature representa…

2019-04-15abs ↗pdf ↗

Autoregressive state transitions, where predictions are conditioned on past predictions, are the predominant choice for both deterministic and stochastic sequential models. However, autoregressive feedback exposes the evolution of the hidden state trajectory to potential biases from well-known train-test discrepancies.…

2019-08-30abs ↗pdf ↗

Hidden Markov models and their variants are the predominant sequential classification method in such domains as speech recognition, bioinformatics and natural language processing. Being generative rather than discriminative models, however, their classification performance is a drawback. In this paper we apply ideas fr…

2013-02-15abs ↗pdf ↗

Kriging is the predominant method used for spatial prediction, but relies on the assumption that predictions are linear combinations of the observations. Kriging often also relies on additional assumptions such as normality and stationarity. We propose a more flexible spatial prediction method based on the Nearest-Neig…

2019-03-28abs ↗pdf ↗

A theoretical performance analysis of the graph neural network (GNN) is presented. For classification tasks, the neural network approach has the advantage in terms of flexibility that it can be employed in a data-driven manner, whereas Bayesian inference requires the assumption of a specific model. A fundamental questi…

2018-10-29abs ↗pdf ↗

We show that dropout training is best understood as performing MAP estimation concurrently for a family of conditional models whose objectives are themselves lower bounded by the original dropout objective. This discovery allows us to pick any model from this family after training, which leads to a substantial improvem…

2018-05-23abs ↗pdf ↗

Study examines cross-training neural networks for financial index prediction.

problem Predicting financial indexes from different markets using machine learning.
method Investigated various neural network architectures and trained them on one market index to predict another.
result Cross-training models on one market index improved prediction accuracy for another market index.

Cardiovascular diseases are one of the most common causes of death in the world. Prevention, knowledge of previous cases in the family, and early detection is the best strategy to reduce this fact. Different machine learning approaches to automatic diagnostic are being proposed to this task. As in most health problems,…

2019-01-28abs ↗pdf ↗

New RLHF approach mitigates bias in aligning LLMs with human preferences.

problem Algorithmic bias in RLHF leading to preference collapse.
method Preference Matching (PM) RLHF, using PM regularizer and conditional variant.
result 29% to 41% improvement in alignment with human preferences.

Paper offers a simple CDS approximation formula with high accuracy.

problem Lack of CDS levels for market appreciation of companies' default risk.
method Developed a global and transparent Equity-to-Credit (E2C) formula using random forest regression.
result Random forest regression with E2C formula achieves 87.3% out-of-sample accuracy in CDS approximations.

Study compares deep learning stock trading strategies in adverse market conditions.

problem Comparing deep learning models for stock trading performance in extreme market downturns.
method Reconstructed three deep learning models and compared their strategies through trading simulations.
result Deep learning models, especially LSTM, can mitigate losses in severe market downturns.

Parallel neural network training yields better long-term prediction accuracy.

problem Choosing the right training strategy for neural networks in dynamical systems.
method Comparison of parallel and series-parallel training strategies on five neural network architectures and two examples.
result Parallel training consistently outperforms series-parallel training in long-term prediction accuracy.

RePULSe improves language model alignment by reducing undesired outputs without sacrificing overall performance.

problem Aligning language models with human preferences while minimizing undesired outputs.
method Integrates probabilistic inference into RL training to reduce undesired outputs.
result RePULSe achieves a better balance between expected reward and undesired output probability.

Study finds neural dialog models struggle with conversational tasks.

problem Insufficient understanding of dialog by neural models.
method Analysis of internal representations and evaluation of model performance.
result Neural dialog models lack key conversational skills like answering questions and inferring contradiction.

Android is the predominant mobile operating system for the past few years. The prevalence of devices that can be powered by Android magnetized not merely application developers but also malware developers with criminal intention to design and spread malicious applications that can affect the normal work of Android phon…

2018-12-26abs ↗pdf ↗

New model reveals significant impact of data and parameter variations on machine learning benchmarks.

problem Variance in machine learning benchmarks due to data sampling, initialization, and hyperparameters.
method Modeling the benchmarking process, analyzing comparison methods, and studying error rates.
result Adding more sources of variation reduces compute cost while improving performance.

Gradual pruning reduces inference cost by pruning least important channels during training.

problem Reduction of deep neural network inference cost.
method Gradual channel pruning using feature relevance scores during training.
result Achieved significant model compression with minimal accuracy loss.

We propose a method to clean covariance matrices of nonstationary systems by using time-independent eigenvalues.

problem Noise in covariance matrices of nonstationary systems with time-independent eigenvalues.
method Data-driven approach to use independent eigenvalues encoding long-term influence of future on present.
result Our method outperforms optimal stationary methods for filtering covariance matrix and its inverse.

Robo-advisors use MPC to create dynamic investment strategies.

problem Static allocation methods limit robo-advisors' effectiveness.
method Combines MPC with Hidden Markov Model and Black-Litterman for dynamic asset allocation.
result MPC-based strategies outperform static approaches in dynamic and risk-budgeting criteria.

The study compares uniform-price and discriminatory auctions in terms of learning difficulty.

problem Comparing the learning difficulty of uniform-price and discriminatory multi-unit auctions.
method Characterization of learning difficulty through regret minimization in both full-information and bandit feedback settings.
result Regret scales similarly for both auction formats under full-information, but uniform-price auctions can achieve faster learning rates.