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

2.6%5.3%7.9%10.6% · Feb 202619922001200920172026
48 results for Dark Channel Prior

The paper examines conditions for linearity in a conditional mean estimator under vector Poisson noise.

problem Conditions for linearity of the conditional mean estimator in vector Poisson noise.
method Analyzes prior distributions and their impact on the conditional mean estimator's linearity.
result The only prior distribution that induces linearity is a product gamma distribution, and non-zero dark current parameter prevents linearity.

This paper investigates the impact of dark pools on price discovery (the efficiency of prices on stock exchanges to aggregate information). Assets are traded in either an exchange or a dark pool, with the dark pool offering better prices but lower execution rates. Informed traders receive noisy and heterogeneous signal…

2016-12-27abs ↗pdf ↗

We explore a model of dark matter called wave dark matter (also known as scalar field dark matter and boson stars) which has recently been motivated by a new geometric perspective by Bray. Wave dark matter describes dark matter as a scalar field which satisfies the Einstein-Klein-Gordon equations. These equations rely …

2013-11-24abs ↗pdf ↗

Paper tackles liquidation in dark pools with adverse selection, proving uniqueness of solution.

problem Liquidation in dark pools with adverse selection for multi-asset portfolios.
method Analyzes a multidimensional stochastic control problem leading to a matrix-valued BSDE with jumps and singular terminal condition.
result Proves uniqueness of solution, novel even in simplified settings.

Machine learning helps infer dark matter substructure from strong lensing images.

problem Extracting information about dark matter substructure from strong lensing images is challenging.
method Simulation-based inference techniques and neural networks trained on simulator data.
result Efficiently trained neural networks can estimate likelihood ratios for substructure parameters.

Bayesian Dark Knowledge fails to perform well with high posterior uncertainty.

problem Performance degradation of Bayesian Dark Knowledge with high posterior uncertainty.
method Compresses posterior predictive distribution into a single network, using a student network matching the teacher ensemble architecture.
result Using a matching student network architecture does not guarantee acceptable performance with high posterior uncertainty.

The idea of end-to-end learning of communications systems through neural network -based autoencoders has the shortcoming that it requires a differentiable channel model. We present in this paper a novel learning algorithm which alleviates this problem. The algorithm iterates between supervised training of the receiver …

2018-04-06abs ↗pdf ↗

Channel normalization prevents vanishing gradients in convolutional neural networks.

problem Vanishing gradients in convolutional neural networks during optimization.
method Channel normalization, which centers and normalizes each channel individually.
result Channel normalization avoids vanishing gradients, enabling efficient optimization.

Probabilistic programming allows specification of probabilistic models in a declarative manner. Recently, several new software systems and languages for probabilistic programming have been developed on the basis of newly developed and improved methods for approximate inference in probabilistic models. In this contribut…

2013-06-02abs ↗pdf ↗

New method uses neural networks to infer dark matter subhalo abundance from stellar streams.

problem Constrain warm dark matter mass using stellar streams.
method Amortized Approximate Likelihood Ratios (AALR) for likelihood-free Bayesian inference.
result Demonstrates effectiveness of new method for estimating dark matter subhalo abundance.

Study optimal liquidation strategies in lit and dark pools with and without regulation.

problem Optimal liquidation strategies in dark and lit pools with execution uncertainty.
method Design optimal make-take fee policies, solve HJB-Fokker-Planck systems, use BSDEs.
result Explicit solutions for optimal strategies in both competitive and regulated markets.

For a market impact model, price manipulation and related notions play a role that is similar to the role of arbitrage in a derivatives pricing model. Here, we give a systematic investigation into such regularity issues when orders can be executed both at a traditional exchange and in a dark pool. To this end, we focus…

2012-05-17abs ↗pdf ↗

Novel channel pruning method accelerates deep CNNs by removing redundant, similar features.

problem Limitations of existing magnitude-based pruning algorithms in similar magnitude cases.
method Hierarchical clustering of channels based on probabilistic similarity metrics, without sparsity training.
result 30% reduction in FLOPs for pruned ResNet-50 on ImageNet, outperforming baseline.

In order to reduce signalling, traders may resort to limiting access to dark venues and imposing limits on minimum fill sizes they are willing to trade. However, doing this also restricts the liquidity available to the trader since an ever increasing quantity of orders are traded by algos in clips. An alternative is to…

2017-10-17abs ↗pdf ↗

We consider a finite-horizon market-making problem faced by a dark pool that executes incoming buy and sell orders. The arrival flow of such orders is assumed to be random and, for each transaction, the dark pool earns a per-share commission no greater than the half bid-ask spread. Throughout the entire period, the mai…

2015-02-10abs ↗pdf ↗

Hybrid model speeds up galaxy simulations by incorporating baryonic properties.

problem Inaccurate baryonic properties in dark matter-only simulations.
method Combining analytic models and machine learning for faster, more accurate simulations.
result Hybrid model outperforms machine learning alone for some baryonic properties.

Dark Experience improves continual learning with a simple, strong baseline.

problem General Continual Learning in scenarios where tasks are not sequential and offline training is not possible.
method Mixing rehearsal with knowledge distillation and regularization.
result Dark Experience outperforms consolidated approaches and leverages limited resources.

Physics-informed neural networks improve baryonic predictions from dark matter simulations.

problem Recreating hydrodynamic simulations from dark matter requires expensive and time-consuming computations.
method Combining neural network architectures with physical constraints and using Kullback-Leibler divergence for prediction comparison.
result Improved accuracy of baryonic predictions based on dark matter halo properties, successful recovery of the metallicity relation, and preserved scatter.

We consider an optimal trading problem over a finite period of time during which an investor has access to both a standard exchange and a dark pool. We take the exchange to be an order-driven market and propose a continuous-time setup for the best bid price and the market spread, both modelled by Lévy processes. Effect…

2014-05-08abs ↗pdf ↗

A multi-user multi-armed bandit (MAB) framework is used to develop algorithms for uncoordinated spectrum access. The number of users is assumed to be unknown to each user. A stochastic setting is first considered, where the rewards on a channel are the same for each user. In contrast to prior work, it is assumed that t…

2018-07-02abs ↗pdf ↗

We establish large deviation principles for convolutional neural networks.

problem Understanding the behavior of convolutional neural networks in the infinite-channel limit.
method We establish large deviation principles for convolutional neural networks under Gaussian prior and posterior distributions.
result We provide a large deviation principle for the sequence of conditional covariance matrices and the posterior distribution.

Study neural communication systems with bandwidth-limited channels.

problem Reliable message transmission despite noisy channels.
method Jointly model compression and error correction with neural networks; introduce prior for missing information; use auxiliary latent variables.
result Joint neural communication systems outperform separate models under expected information loss.

The paper examines how macroeconomic control tools lost effectiveness, leading to a 'dark ages' period.

problem Loss of effectiveness of control tools in macroeconomic stabilization policy.
method Historical analysis of macroeconomic stabilization policy from 1948 to 1993.
result The overstatement of the Lucas critique and Kydland and Prescott's time-inconsistency led to a period of ineffective stabilization policy.

We consider an illiquid financial market where a risk averse investor has to liquidate a portfolio within a finite time horizon [0,T] and can trade continuously at a traditional exchange (the "primary venue") and in a dark pool. At the primary venue, trading yields a linear price impact. In the dark pool, no price impa…

2012-01-30abs ↗pdf ↗

New method separates and deconvolves signals from single-channel mixtures.

problem Separating and deconvolving individual sources from a single-channel mixture.
method Synthesizing-decomposition (S-D) approach using GAN for sources and optimization for filters and sources.
result Achieves PSNR improvements over existing methods in various tasks.

We study the problem of allocating stocks to dark pools. We propose and analyze an optimal approach for allocations, if continuous-valued allocations are allowed. We also propose a modification for the case when only integer-valued allocations are possible. We extend the previous work on this problem to adversarial sce…

2010-03-11abs ↗pdf ↗

This paper proposes a method to improve neural network quantization without retraining.

problem Handling outliers in quantized DNN weights and activations.
method Outlier Channel Splitting (OCS) which duplicates channels containing outliers and halves their values.
result OCS outperforms state-of-the-art clipping techniques with minimal overhead.

ESCHER avoids importance sampling to estimate regret in large games.

problem Estimating Nash equilibria in large games with high variance.
method Computes a history value function to estimate regret without importance sampling.
result ESCHER reduces regret estimation variance significantly compared to existing methods.

This study uses ARM to analyze pedestrian crashes under different lighting conditions.

problem Identifying crash risk factors under varying lighting conditions.
method Applied Association Rules Mining to Louisiana pedestrian crash data.
result Daylight crashes are associated with children, seniors, and older drivers.

Interpreting black box classifiers, such as deep networks, allows an analyst to validate a classifier before it is deployed in a high-stakes setting. A natural idea is to visualize the deep network's representations, so as to "see what the network sees". In this paper, we demonstrate that standard dimension reduction m…

2018-03-11abs ↗pdf ↗

This study identifies RwD crash patterns on rural two-lane highways under different lighting conditions.

problem Insufficient investigation of RwD crashes under varying lighting conditions.
method Data mining using association rules mining (ARM) on crash database.
result Interesting crash patterns and risk factors identified under different lighting conditions.