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,695 papers · 148 categories

Trend · papers per month

116232348464 · Jun 202019922001200920172026
48 results for depth information

A new data-level recombination strategy improves RGB-D salient object detection.

problem RGB-D salient object detection struggles with depth information.
method Proposes a novel data-level recombination strategy to fuse RGB and depth data before feature extraction.
result Achieves a new state-of-the-art performance in RGB-D salient object detection.

Study reveals how Fisher information changes with network depth, finding it grows linearly.

problem Understanding the trainability of deep neural networks (DNNs).
method Investigates the spectral distribution of the conditional Fisher information matrix (FIM) for fully-connected networks achieving dynamical isometry.
result The conditional FIM's spectrum concentrates around the maximum and grows linearly with depth.

We study the behavior of untrained neural networks whose weights and biases are randomly distributed using mean field theory. We show the existence of depth scales that naturally limit the maximum depth of signal propagation through these random networks. Our main practical result is to show that random networks may be…

2016-11-04abs ↗pdf ↗

Self-attention models benefit equally from width and depth, but beyond a certain point, depth becomes less efficient.

problem Understanding the optimal balance between depth and width in self-attention models.
method Theoretical predictions and empirical ablations on networks of varying depths and widths.
result An optimal width of 30K is recommended for a 1-Trillion parameter network, marking a significant width for self-attention models.

We describe a method to infer dense depth from camera motion and sparse depth as estimated using a visual-inertial odometry system. Unlike other scenarios using point clouds from lidar or structured light sensors, we have few hundreds to few thousand points, insufficient to inform the topology of the scene. Our method …

2019-05-15abs ↗pdf ↗

In this paper, we present a framework to control a self-driving car by fusing raw information from RGB images and depth maps. A deep neural network architecture is used for mapping the vision and depth information, respectively, to steering commands. This fusion of information from two sensor sources allows to provide …

2019-02-12abs ↗pdf ↗

In this paper, we present a multi-period trading model in the style of Kyle (1985)'s inside trading model, by assuming that there are at least two insiders in the market with long-lived private information, under the requirement that each insider publicly discloses his stock trades after the fact. Based on this model, …

2011-03-04abs ↗pdf ↗

Study explores how dataset breadth and depth affect Siamese Neural Network performance.

problem Impact of dataset breadth and depth on Siamese Neural Network performance.
method Experiments with three keystroke datasets varying breadth and depth factors.
result Increasing dataset breadth improves model performance, while depth's impact varies by dataset type.

MPNNs over-squash distant node information, study shows.

problem Over-squashing in MPNNs where node features ignore distant nodes.
method Theoretical analysis of MPNNs' over-squashing, focusing on width, depth, and graph topology.
result Width mitigates over-squashing but makes network more sensitive, depth doesn't help, graph topology is key.

Our study analyzes how neural network initialization affects privacy and utility in overparameterized models.

problem Privacy and utility trade-off in overparameterized neural networks.
method Analytical proof of KL divergence privacy bound, focusing on initialization, width, and depth.
result Privacy bound improvement with increasing depth under certain initializations, degradation under others.

This paper introduces depth functions for ranking data, improving statistical summaries.

problem Lack of comprehensive statistical summaries for ranking data.
method Metric-based depth functions on symmetric group to define rankings, depths, and procedures.
result Novel depth functions provide a more informative summary of ranking data.

We present an unsupervised approach for learning to estimate three dimensional (3D) facial structure from a single image while also predicting 3D viewpoint transformations that match a desired pose and facial geometry. We achieve this by inferring the depth of facial keypoints of an input image in an unsupervised manne…

2018-03-25abs ↗pdf ↗

Study reveals how depth of reasoning affects generalization in models.

problem Understanding scaling behavior of generalization with CoT depth.
method Theoretical model of CoT in linear regression using random matrix theory.
result Sharp phase transition between exponential and polynomial improvement, saturation, and overthinking.

Understanding the representational power of Deep Neural Networks (DNNs) and how their structural properties (e.g., depth, width, type of activation unit) affect the functions they can compute, has been an important yet challenging question in deep learning and approximation theory. In a seminal paper, Telgarsky highlig…

2019-12-09abs ↗pdf ↗

Deep RNNs excel at capturing long-term dependencies in sequential data.

problem Lack of a formal measure for RNNs' long-term memory capacity.
method Introduced a measure called Start-End separation rank to quantify RNNs' ability to model long-term dependencies.
result Deep RNNs support Start-End separation ranks that are combinatorially higher than shallow ones.

Technological development aims to produce generations of increasingly efficient robots able to perform complex tasks. This requires considerable efforts, from the scientific community, to find new algorithms that solve computer vision problems, such as object recognition. The diffusion of RGB-D cameras directed the stu…

2018-07-31abs ↗pdf ↗

In this paper, we prove that depth with nonlinearity creates no bad local minima in a type of arbitrarily deep ResNets with arbitrary nonlinear activation functions, in the sense that the values of all local minima are no worse than the global minimum value of corresponding classical machine-learning models, and are gu…

2018-10-21abs ↗pdf ↗

Study shows marketable order routing to wholesalers benefits all traders, leading to lower market depth and price volatility.

problem Determining the preference of retail traders for marketable order routing.
method Two models: one for market makers competing for retail order flow (Bertrand model) and another for price-taking competitive liquidity providers (open exchange model).
result Routing marketable orders to wholesalers is preferred by all traders, leading to mean reverting inventories and lower market depth.

The paper develops a method to create robust control policies for robots using information bottlenecks.

problem Robotic control policies are sensitive to task-irrelevant state and sensor changes.
method Derives a policy gradient algorithm that creates an information bottleneck between states and task-relevant representations.
result Task-driven policies are more robust to sensor noise and environmental changes.

Price impact of a trade is an important element in pre-trade and post-trade analyses. We introduce a framework to analyze the market price of liquidity risk, which allows us to derive an inhomogeneous Bernoulli ordinary differential equation. We obtain two closed form solutions, one of which reproduces the linear funct…

2019-12-10abs ↗pdf ↗

This is the third of three papers that refine and extend portions of our earlier preprint, "The depth of a knot tunnel." Together, they rework the entire preprint. In this paper, we use the theory of tunnel number 1 knots that we introduced in "The tree of knot tunnels" to strengthen the Tunnel Leveling Theorem of H. G…

2008-12-07abs ↗pdf ↗

Regression Trees analyze stock returns, revealing market excess return as the most informative factor.

problem Understanding informational content of three factors in stock returns.
method Joint regression tree analysis of daily stock return data for 5 major US corporations.
result The market excess return factor is always the most informative in all cases (solo and joint).

The paper studies randomized approximations of Tukey's depth for log-concave isotropic data.

problem The challenge of approximating Tukey's depth in high dimensions.
method The study examines randomized algorithms for approximating Tukey's depth for log-concave isotropic data.
result Randomized algorithms correctly approximate maximal depth and close to zero depths but not intermediate depths.

Proposes a new information-theoretic framework for analyzing deep neural networks.

problem Difficulty in analyzing deep neural networks using existing theoretical frameworks.
method Introduces an information-theoretic framework with new notions of regret and sample complexity.
result Establishes sample complexity bounds for deep neural networks that are width-independent and linear in depth.

This study uses deep learning to analyze stock market sentiment from financial forums.

problem Improving stock market prediction accuracy through emotional analysis.
method Crawling financial forum data, training Bert model on financial corpus, using MIC for comparison.
result BERT model's emotional analysis of financial texts correlates with stock market fluctuations.

Proves depth 2 neural networks can't approximate certain functions as well as depth 3 networks.

problem Approximating functions with depth 2 networks in high dimensions.
method Lower bound proof using worst-to-average-case random self-reducibility.
result Proves depth 2 networks can't approximate certain functions as well as depth 3 networks, resolving an open problem.