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

105210314419 · Jun 202019922001200920172026
48 results for ancillary information

DART2 enhances multiple testing by leveraging ancillary information robustly.

problem Enhancing multiple testing power with uncertain ancillary information.
method Distance-assisted multiple testing procedure (DART2) that handles both helpful and misleading ancillary information.
result DART2 asymptotically controls FDR and improves power when ancillary information is helpful, maintaining FDR and power otherwise.

Proposes a new GAN architecture for generating data conditioned on partial information.

problem Generating data conditioned on partial ancillary information.
method Introduces a new Adversarial Network architecture and training strategy.
result The proposed method outperforms standard Conditional GANs in generating data under partial conditioning.

This paper improves bidding price prediction for ancillary services markets, boosting revenues.

problem Volatility in renewable energy sources affects grid stability and revenue optimization.
method Machine learning models (SVR, DT, k-NN) and offset adjustment for pay-as-bid markets.
result The proposed approach increases potential revenues by 27.43% to 37.31% compared to baseline models.

Ancillaries have become a major source of revenue and profitability in the travel industry. Yet, conventional pricing strategies are based on business rules that are poorly optimized and do not respond to changing market conditions. This paper describes the dynamic pricing model developed by Deepair solutions, an AI te…

2019-02-06abs ↗pdf ↗

Optimizes profit in targeted marketing across multiple markets with varying marketing expenditures.

problem Maximizing profit in a sequential marketing strategy with multiple markets and varying marketing costs.
method Near-optimal algorithms in an adversarial bandit setting, proving regret bounds for different demand curve types.
result Proved near-optimal regret bounds for the profit-maximization problem in targeted marketing.

We consider a natural model of random knotting- choose a knot diagram at random from the finite set of diagrams with n crossings. We tabulate diagrams with 10 and fewer crossings and classify the diagrams by knot type, allowing us to compute exact probabilities for knots in this model. As expected, most diagrams with 1…

2015-12-17abs ↗pdf ↗

The sharp and recent increase in the availability of data captured by different sensors combined with their considerably heterogeneous natures poses a serious challenge for the effective and efficient processing of remotely sensed data. Such an increase in remote sensing and ancillary datasets, however, opens up the po…

2018-12-19abs ↗pdf ↗

The problem of finding a reduced dimensionality representation of categorical variables while preserving their most relevant characteristics is fundamental for the analysis of complex data. Specifically, given a co-occurrence matrix of two variables, one often seeks a compact representation of one variable which preser…

2012-10-19abs ↗pdf ↗

This paper strengthens the central limit theorem for order statistics using relative entropy.

problem Establishing a stronger mode of convergence for central limit behavior of order statistics.
method Using relative entropy to ensure a stronger mode of convergence for central limit behavior of order statistics.
result An order O(1/n)O(1/\sqrt{n}) rate of convergence is established under mild conditions.

Multiple machine learning and prediction models are often used for the same prediction or recommendation task. In our recent work, where we develop and deploy airline ancillary pricing models in an online setting, we found that among multiple pricing models developed, no one model clearly dominates other models for all…

2019-05-21abs ↗pdf ↗

The general theory of boundary value problems for linear elliptic wedge operators (on smooth manifolds with boundary) leads naturally, even in the scalar case, to the need to consider vector bundles over the boundary together with general smooth fiberwise multiplicative group actions. These actions, essentially trivial…

2013-01-24abs ↗pdf ↗

Rigidity theorem for critical points of Allen-Cahn equation on S³.

problem Rigidity of critical points with low Morse index on S³.
method Analysis of nullity and symmetries of critical points, Frankel-type theorem for nodal sets.
result Critical points with index five are symmetric and vanish on a Clifford torus, realizing the fifth width of the min-max spectrum.

TeLeS improves ASR confidence estimation by considering temporal alignment and lexical errors.

problem Inaccurate confidence scores from E2E ASR models, especially for overconfident predictions.
method Proposes TeLeS, a novel confidence score that considers temporal alignment and lexical errors, and uses shrinkage loss to handle data imbalance.
result TeLeS generalizes well across different languages and ASR models, leading to significant WER reduction.

This paper investigates the approximation power of three types of random neural networks: (a) infinite width networks, with weights following an arbitrary distribution; (b) finite width networks obtained by subsampling the preceding infinite width networks; (c) finite width networks obtained by starting with standard G…

2019-06-18abs ↗pdf ↗

Bayesian transfer learning improves predictive performance with limited source data.

problem Improving statistical procedures with limited target and source datasets.
method Total risk prior for joint parameter distribution, Bayesian Lasso, model averaging, Gibbs sampling.
result Superior predictive performance compared to frequentist baseline, especially with limited source data.

In this paper, we propose a novel hash learning approach that has the following main distinguishing features, when compared to past frameworks. First, the codewords are utilized in the Hamming space as ancillary techniques to accomplish its hash learning task. These codewords, which are inferred from the data, attempt …

2019-02-22abs ↗pdf ↗

Study uses SAR data to estimate forest vegetation indices, improving monitoring of temperate forests.

problem Limitations of optical satellite data in monitoring forest ecosystems, especially due to atmospheric effects.
method Estimating four vegetation indices (LAI, FAPAR, EVI, NDVI) using multitemporal Sentinel-1 SAR and ancillary data.
result Accurate estimation of forest vegetation indices using SAR data, achieving high R2R^2 and low MAE values.

Quantum-assisted Gaussian process speeds up data regression.

problem High computational complexity of Gaussian process regression for large datasets.
method Quantum-assisted sparse Gaussian process regression using random Fourier features.
result Achieves polynomial-order computational speedup compared to classical methods.

This paper improves hierarchical community detection efficiency using local structural properties.

problem Efficiency of hierarchical community detection methods in large networks.
method Use of local structural network properties as proxies to improve efficiency.
result Achieves competitive results in modularity with improved efficiency.

Quantum algorithm solves financial option pricing using Hamiltonian simulation.

problem Efficiently solving the Black-Scholes equation for option pricing dynamics.
method Mapped Black-Scholes equation to Schrödinger equation, used efficient Hamiltonian simulation techniques.
result Quantum algorithm shows feasible approach for solving financial derivatives on a quantum computer.

Study examines barriers to grid-connected battery systems in Spain, finding high cycle cost remains main obstacle.

problem Barriers to grid-connected battery systems in Spain's deregulated electricity market.
method Utilization analysis and concept of 'potentially profitable utilization time' introduced.
result High cycle cost remains the main barrier for grid-connected battery systems in Spain.

This paper operationalizes the Exponential Mechanism using Normalizing Flows for private optimization.

problem Improving privacy in machine learning while maintaining accuracy and efficiency.
method Using Normalizing Flows to approximate sampling from the Exponential Mechanism for private optimization.
result ExpM+NF provides more privacy than non-private SGD but not as much as DPSGD.

New method uses rank-conditioned Horvitz-Thompson estimation for unbiased sample reuse in Plackett-Luce best-of-K objective.

problem Estimating the expected maximum reward in Plackett-Luce draws without replacement.
method Rank-conditioned Horvitz-Thompson estimation with joint-score REINFORCE for unbiased sample reuse.
result Unbiased estimation of the Plackett-Luce best-of-K objective with finite second moment guarantees.

We simplify information measure computation using learned features.

problem Computing information measures from raw data is computationally expensive.
method Developed a separable design for computing information measures from learned feature representations.
result A variety of information measures can be computed efficiently through learned feature representations.

A new framework for information theory considers computational constraints.

problem Understanding information in complex systems with computational limitations.
method Variational extension of Shannon's information theory with computational constraints.
result Predictive V\mathcal{V}-information can be created through computation and reliably estimated from data.

An asymmetric information model is introduced for the situation in which there is a small agent who is more susceptible to the flow of information in the market than the general market participant, and who tries to implement strategies based on the additional information. In this model market participants have access t…

2008-07-08abs ↗pdf ↗

We study a simple model of an asset market with informed and non-informed agents. In the absence of non-informed agents, the market becomes information efficient when the number of traders with different private information is large enough. Upon introducing non-informed agents, we find that the latter contribute signif…

2010-04-28abs ↗pdf ↗

New method quantifies redundant information using information bottleneck.

problem Quantifying redundant information among multiple sources.
method Formulated as an information bottleneck problem, termed redundancy bottleneck.
result Extracts information that best predicts the target without revealing source identity.

Review of information plane analyses in neural networks, highlighting mixed results and methodological challenges.

problem Understanding the relationship between information-theoretic compression and neural network performance.
method Literature review and detailed analysis of information quantity estimation methods.
result Information plane compression is not necessarily information-theoretic but compatible with geometric compression.

Information theory provides a mathematical foundation to measure uncertainty in belief. Belief is represented by a probability distribution that captures our understanding of an outcome's plausibility. Information measures based on Shannon's concept of entropy include realization information, Kullback-Leibler divergenc…

2019-11-21abs ↗pdf ↗

In financial markets valuable information is rarely circulated homogeneously, because of time required for information to spread. However, advances in communication technology means that the 'lifetime' of important information is typically short. Hence, viewed as a tradable asset, information shares the characteristics…

2011-06-28abs ↗pdf ↗