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

4182123164 · Jun 202019922001200920172026
48 results for Total Gain

Proposes new attribution methods for trees with regularization.

problem Feature attribution for trees trained with regularization.
method Prediction Decomposition Attribution (PreDecomp) and TreeInner.
result TreeInner shows state-of-the-art feature selection performance.

We consider a financial contract that delivers a single cash flow given by the terminal value of a cumulative gains process. The problem of modelling and pricing such an asset and associated derivatives is important, for example, in the determination of optimal insurance claims reserve policies, and in the pricing of r…

2007-10-15abs ↗pdf ↗

Imagine a patient in critical condition. What and when should be measured to forecast detrimental events, especially under the budget constraints? We answer this question by deep reinforcement learning (RL) that jointly minimizes the measurement cost and maximizes predictive gain, by scheduling strategically-timed meas…

2019-01-24abs ↗pdf ↗

ActiveCQ improves causal quantity estimation with active learning and Gaussian Processes.

problem Estimating causal quantities requires large datasets, which are costly.
method Unified framework using Gaussian Processes and conditional mean embeddings for distribution estimation. Derived principled acquisition strategies based on information gain and total variance reduction.
result Framework significantly outperforms baselines in sample efficiency across various causal quantities.

We introduce a strategic behavior in reinsurance bilateral transactions, where agents choose the risk preferences they will appear to have in the transaction. Within a wide class of risk measures, we identify agents' strategic choices to a range of risk aversion coefficients. It is shown that at the strictly beneficial…

2019-09-04abs ↗pdf ↗

Most of machine learning deals with vector parameters. Ideally we would like to take higher order information into account and make use of matrix or even tensor parameters. However the resulting algorithms are usually inefficient. Here we address on-line learning with matrix parameters. It is often easy to obtain onlin…

2015-06-16abs ↗pdf ↗

Two new deterministic offspring selection methods reduce statistical distance in SMC and pMCMC.

problem Improving the performance of resampling in SMC methods.
method Proposes two deterministic offspring selection methods to minimize KL divergence and TV distance.
result Our methods outperform or match state-of-the-art resampling schemes on benchmarks.

Study decomposes uncertainty in HK-distribution parameter estimation for QUS.

problem Uncertainty in HK-distribution parameter estimation for quantitative ultrasound.
method Bayesian Neural Networks (BNNs) for parameter estimation and uncertainty decomposition.
result Decomposes total predictive uncertainty into epistemic and aleatoric components.

Study examines how body segments respond to random vibrations.

problem Understanding human body responses to random vibrations.
method 35 participants were tested with random noise signals. Multiple linear regression models were created to determine influential predictors of peak translational gains.
result Multiple predictors, including motion direction and body segment, significantly influence peak translational gains.

New method controls false discoveries in real-time data streams.

problem Online testing of hypotheses with strict error constraints and no future data.
method Structure-adaptive sequential testing (SAST) with alpha-investment algorithm.
result Substantial power gain over existing online testing rules.

Improves likelihood-free inference by using a new sampling approach to avoid biased data collection.

problem Efficient Bayesian inference without likelihood evaluation for real-world datasets.
method Introduces Neural Proposal (NP) to sample simulation inputs i.i.d. for unbiased posterior inference.
result Demonstrates improved performance, especially for multi-modal posteriors, through experiments.

We propose a new model of minority game with so-called smart agents such that the standard deviation and the total loss in this model reach the theoretical minimum values in the limit of long time. The smart agents use trail and error method to make a choice but bring global optimization to the system, which suggests t…

2004-06-15abs ↗pdf ↗

Measuring information value in markets using covariance of price changes and order flow.

problem Determining the value of information in financial markets.
method Using high-frequency data on US equities, the covariance between price changes and order flow is estimated to measure information value.
result The aggregate value of information is about 0.04% of market cap, significantly lower than fees investors pay.

While neural networks have achieved vastly enhanced performance over traditional iterative methods in many cases, they are generally empirically designed and the underlying structures are difficult to interpret. The algorithm unrolling approach has helped connect iterative algorithms to neural network architectures. Ho…

2019-02-09abs ↗pdf ↗

Introduces relative information gain for improving Gaussian process regression rates.

problem Improving the sample complexity of estimating or maximizing unknown functions.
method Introduces relative information gain, interpolates between effective dimension and information gain, and proves PAC-Bayesian bounds.
result Obtains minimax-optimal rates of convergence through the relative information gain.

Paper studies fundamental limits of communication in distributed learning.

problem Communication efficiency in model aggregation for distributed learning.
method Rate-Distortion approach to model aggregation as a vector Gaussian CEO problem.
result Derives rate region bound and sum-rate-distortion function for model aggregation.

Text generation is a crucial task in NLP. Recently, several adversarial generative models have been proposed to improve the exposure bias problem in text generation. Though these models gain great success, they still suffer from the problems of reward sparsity and mode collapse. In order to address these two problems, …

2018-04-30abs ↗pdf ↗

A trading system uses LLMs to adapt to volatile crypto markets.

problem Volatility and market sentiment in cryptocurrencies make traditional models ineffective.
method Specialized LLM agents for technical analysis, sentiment evaluation, and decision-making; verbal feedback for continuous improvement.
result Agents outperform buy-and-hold strategy with consistent gains across market phases.

We present a generalization of the Simultaneous Long-Short (SLS) trading strategy described in recent control literature wherein we allow for different parameters across the short and long sides of the controller; we refer to this new strategy as Generalized SLS (GSLS). Furthermore, we investigate the conditions under …

2018-06-14abs ↗pdf ↗

For decomposable score-based structure learning of Bayesian networks, existing approaches first compute a collection of candidate parent sets for each variable and then optimize over this collection by choosing one parent set for each variable without creating directed cycles while maximizing the total score. We target…

2017-07-19abs ↗pdf ↗

The gain-loss ratio is known to enjoy very good properties from a normative point of view. As a confirmation, we show that the best market gain-loss ratio in the presence of a random endowment is an acceptability index and we provide its dual representation for general probability spaces. However, the gain-loss ratio w…

2012-09-28abs ↗pdf ↗

New EPS insurance offers partial protection against superannuation losses.

problem Lack of efficient investment insurance for superannuation holders.
method Developed a new financial derivative, equity protection swap (EPS), and derived a fair pricing formula.
result EPS can be an efficient investment insurance tool for superannuation accounts.

Compact neural networks improve reinforcement learning performance with less data.

problem Sample inefficiency in deep reinforcement learning.
method Tensor factorization and wavelet scattering for compact representation.
result Achieved 2-10 times fewer total coefficients with comparable performance.

Eluder dimension and information gain are equivalent for reproducing kernel Hilbert spaces.

problem Complexity measures in bandit and reinforcement learning.
method Equivalence of eluder dimension and information gain for reproducing kernel Hilbert spaces.
result Eluder dimension and information gain are equivalent for reproducing kernel Hilbert spaces.

Investment horizon approach has been used to analyze indexes of Polish stock market.Optimal time horizon for each return value is evaluated by fitting appropriate function form of the distribution. Strong asymmetry of gain-loss curves is observed for WIG index, whereas gain and loss curves look similar for WIG20 and fo…

2006-08-22abs ↗pdf ↗

Adversaries with multiple antennas can fool deep learning modulators more effectively.

problem Improving evasion attacks on deep learning-based modulation classifiers.
method Utilizing multiple antennas to enhance adversarial attacks on deep learning classifiers.
result Adversarial attacks with multiple antennas significantly improve classifier accuracy.

We study the problem of online path learning with non-additive gains, which is a central problem appearing in several applications, including ensemble structured prediction. We present new online algorithms for path learning with non-additive count-based gains for the three settings of full information, semi-bandit and…

2018-04-18abs ↗pdf ↗

Deep FPF approximates gain function for high-dimensional particle filtering.

problem Approximating the exact gain function in high-dimensional settings.
method Represent the gain function as a neural network gradient and solve a variational Poisson equation via optimization.
result The approach allows parallel processing of particles and is applicable to high-dimensional problems.

Extends Demographic Parity for fairer wage predictions with expert knowledge.

problem Inadequate fairness metrics limit user domain knowledge and ignore intersectional fairness.
method Develops a parametric method to incorporate expert knowledge in fair predictions.
result Offers a robust solution for real-life applications with limited data and spending constraints.

A 3-stage method enhances hyperspectral image classification accuracy.

problem Classifying detailed classes in hyperspectral images with limited labeled data.
method Uses Nested Sliding Window and PCA for spatial consistency, SVM for spectral estimation, and TV model for spatial smoothing.
result Our method outperforms state-of-the-art algorithms, especially in scenarios with small training sets.

LACD uses unlabeled data to improve conditional diffusion models.

problem Costly and time-consuming acquisition of labeled data.
method Label-augmented conditional diffusion (LACD) with joint denoising score matching.
result LACD converges faster in total variation and Wasserstein-1 distances with sufficient unlabeled data.

Study on sample complexity of policy gradient for stabilizing linear systems under multiplicative noise.

problem Learning optimal feedback gain for stabilizing linear systems with multiplicative noise.
method Analyzes the sample complexity of policy gradient methods, addressing the cusp obstruction and using symmetry to control divergent parts of the gradient.
result Proves that projected mini-batch policy gradient attains total sample complexity of O(1/η) when noise density is known and O(η^(-(2s+1)/(2s))) when estimated, for C^s noise densities with s ≥ 2.

Study adds investment gains and losses to recursive utility model, proving existence and uniqueness of utility process.

problem Existence and uniqueness of utility process in a recursive utility model with investment gains and losses.
method Generalized recursive utility model with constant elasticity of intertemporal substitution and relative risk aversion degree. Proved existence and uniqueness in a specific, finite-state Markovian setting.
result Utility process exists and is unique when agent derives nonnegative gain-loss utility, and non-existent or non-unique otherwise.

Classifies totally geodesic submanifolds in Hopf-Berger spheres.

problem Classifying totally geodesic submanifolds in Hopf-Berger spheres.
method Investigates Hopf-Berger spheres, a special family of homogeneous spaces diffeomorphic to spheres constructed via Hopf fibrations.
result Discovered intriguing examples of totally geodesic submanifolds, including isometric submanifolds of real projective spaces and non-congruent submanifolds.