Informed traders need to trade fast in order to profit from their private information before it becomes public. Fast electronic markets provide such liquidity. Slow markets provide execution in an auction based trading floor. Hybrid markets combine both execution venues. In its main result, the paper shows that to comp…
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
48 results for “information floor”
Language models allocate information storage, not collapsing into uniform representations.
problem Incomplete neural collapse in language model representations.
method Analyzing variance and information sharing across 14 models, proving an information floor.
result Within-class variance is allocated information storage, not collapsed into uniform representations.
The study uses machine learning to analyze office floor plans and predict function based on geometry.
problem Lack of formalisms to describe spatial affordance in automated floor-plan generation tools.
method Supervised and unsupervised data mining techniques, including J48 algorithm, were used to analyze office floor plans.
result J48 algorithm can predict class performance on unseen examples up to 79.5% for office dataset.
In this paper, we propose hybrid building/floor classification and floor-level two-dimensional location coordinates regression using a single-input and multi-output (SIMO) deep neural network (DNN) for large-scale indoor localization based on Wi-Fi fingerprinting. The proposed scheme exploits the different nature of th…
One of the key technologies for future large-scale location-aware services covering a complex of multi-story buildings --- e.g., a big shopping mall and a university campus --- is a scalable indoor localization technique. In this paper, we report the current status of our investigation on the use of deep neural network…
Machine-Learning-Driven New Geologic Discoveries at Mars Rover Landing Sites: Jezero and NE Syrtisastro-ph.EP
A hierarchical Bayesian classifier is trained at pixel scale with spectral data from the CRISM (Compact Reconnaissance Imaging Spectrometer for Mars) imagery. Its utility in detecting rare phases is demonstrated with new geologic discoveries near the Mars-2020 rover landing site. Akaganeite is found in sediments on the…
Expedited Multi-Target Search with Guaranteed Performance via Multi-fidelity Gaussian Processescs.RO
Algorithm speeds up search for stationary targets with guaranteed accuracy.
problem Minimize search time while ensuring high detection accuracy of stationary targets.
method Multi-fidelity Gaussian process model and EMTS algorithm.
result Guaranteed performance in target detection accuracy and search time.
A framework for cost of belief revision in uncertain agents.
problem Cost of revising beliefs in uncertain agents.
method Axiomatic framework for transport-based belief costs, postulates P0 and P1.
result Cost metric is conformally reweighted by Fisher information, leading to a cost floor diverging at certainty.
Improved analysis for fair federated learning reduces dependence on noise floor.
problem Asymptotic stationarity in group fair federated learning with reduced noise floor dependence.
method DS FedProxGrad framework with inexact local proximal solutions and fairness regularization.
result Algorithm converges asymptotically to stationarity without dependence on a noise floor.
We study the portfolio selection problem of a long-run investor who is maximising the asymptotic growth rate of her expected utility. We show that, somewhat surprisingly, it is essentially not affected by introduction of a floor constraint which requires the wealth process to dominate a given benchmark at all times. We…
Consider an agent who enters a financial market on day t = 0 with an initial capital amount x. He invests this amount on stocks and the money market, and by day t = T, has generated a wealth W . He is given a convex class of probability measures (called scenarios) and a real-valued function (or floors) corresponding to…
The paper develops a theory for random forests, separating variance components and providing methods for estimating prediction intervals.
problem Understanding the variance and uncertainty in random forest predictions.
method Design-based theory, Monte Carlo averaging, PASR resampling.
result The floor of prediction uncertainty is positive and persists even without observation overlap, providing conservative prediction intervals.
A Walk with SGDstat.ML
We present novel empirical observations regarding how stochastic gradient descent (SGD) navigates the loss landscape of over-parametrized deep neural networks (DNNs). These observations expose the qualitatively different roles of learning rate and batch-size in DNN optimization and generalization. Specifically we study…
Machine learning has been widely applied to various applications, some of which involve training with privacy-sensitive data. A modest number of data breaches have been studied, including credit card information in natural language data and identities from face dataset. However, most of these studies focus on supervise…
The paper uses Bayesian Surprise to identify unexpected structures in indoor environments.
problem Identifying unexpected structures in indoor environments.
method Bayesian Surprise applied to Isovist Analysis of 2D floor plans.
result Surprise regions in indoor environments can be used to focus on important areas in LBS.
Study proposes explainable analytics for manufacturing process planning.
problem Improving data-driven decision-making in manufacturing.
method Combines process mining, machine learning, and XAI. Uses deep learning for prediction and Shapley values/ICE plots for explanations.
result Enhanced decision-making capabilities through local post-hoc explanations.
The paper decomposes unsupervised learning's generalization error into model, data, and variance components.
problem Understanding the components of unsupervised learning's generalization error.
method Information-geometric decomposition of the Kullback-Leibler generalization error.
result The optimal rank in -PCA is the noise floor, balancing model-error gain and data-bias cost.
EdgeLite detects hazardous supermarket floors, improving safety.
problem Detecting hazardous conditions on supermarket floors to prevent injuries.
method Developed a lightweight deep learning model, EdgeLite, for edge devices.
result EdgeLite outperformed state-of-the-art models in detecting hazards on supermarket floors.
We determine the price of digital double barrier options with an arbitrary number of barrier periods in the Black-Scholes model. This means that the barriers are active during some time intervals, but are switched off in between. As an application, we calculate the value of a structure floor for structured notes whose …
Learning Enhanced Structural Representations with Block-Based Uncertainties for Ocean Floor Mappingcs.LG
Enhances ocean floor mapping with adaptive uncertainty estimates.
problem Inaccurate bathymetric data for precise ocean modeling.
method Block-based conformal prediction with VQ-VAE architecture.
result Significant improvements in reconstruction quality and uncertainty estimation reliability.
Unified framework for mean testing under truncation bias.
problem High-dimensional mean testing under arbitrary truncation.
method Characterizes fundamental limits and develops a simple second-order test.
result Unified framework connects finite-moment, sub-Gaussian, and median-regular structural regimes.
Develops a new framework for perpetual futures on binary prediction markets.
problem Lack of effective risk management in perpetual futures on binary prediction markets.
method PIRAP framework with six components: index estimator, margin sizing, leverage, funding rule, halt protocol, and eligibility framework.
result Mixed results from empirical evaluation, with some pre-registered floors passing and others failing.
A training-free conformal interval is a mandatory baseline for probabilistic time-series forecasting.
problem Comparing probabilistic forecasters against weak or omitted baselines.
method A simple conformal interval with no parameters and no training.
result The ConformalNaive interval decisively beats several baselines.
Language models fail to process hallucinated responses, and this study diagnoses the failure.
problem Language models fail to process hallucinated responses, leading to over-concentration or diffuse attention.
method The study uses forced scoring of benchmark-labeled responses to compute attention shapes and analyze the symmetric component of the degree-normalized attention operator.
result The study proves that every transpose-invariant spectral diagnostic of the attention operator is orientation-blind and bounds the sensitivity of any Lipschitz diagnostic by the asymmetry coefficient \(G\).
Deep Network with Approximation Error Being Reciprocal of Width to Power of Square Root of Depthcs.LG
New network approximates functions with error decreasing with network width and depth.
problem Approximating functions with high-dimensional data.
method Floor-ReLU networks with specific width and depth.
result Approximation error decreases as network width and depth increase.
The study bounds exceptional surgeries for hyperbolic knots.
problem Identifying the range of slopes for exceptional surgeries.
method Analyzing meridional and non-meridional surgeries, and investigating the relationship between boundary slopes and exceptional surgeries.
result There are boundary slopes such that all non-trivial exceptional surgeries occur in the interval . The integers in $[\ceil{b_1}, \floor{b_2}]$ are all exceptional surgeries.
The relationships between braid ordering and the geometry of its closure is studied. We prove that if an essential closed surface in the complements of closed braid has relatively small genus with respect to the Dehornoy floor of the braid, is circular-foliated in a sense of Birman-Menasco's Braid foliation the…
A new method selects models for ensemble learning to maximize mutual information, outperforming existing approaches.
problem Selecting models for ensemble learning to improve performance and reduce correlation issues.
method Formulate budgeted ensemble selection as maximizing mutual information, use Gaussian-copula to model correlated errors, propose a greedy mutual-information selection algorithm.
result Our method consistently outperforms strong baselines across multiple datasets.
Efficient dispatching rule in manufacturing industry is key to ensure product on-time delivery and minimum past-due and inventory cost. Manufacturing, especially in the developed world, is moving towards on-demand manufacturing meaning a high mix, low volume product mix. This requires efficient dispatching that can wor…
The paper analyzes Adam and SGD in nonstationary optimization, revealing tradeoffs between noise and drift.
problem Analyzing Adam and SGD in nonstationary optimization problems.
method Theoretical analysis of Adam and SGD under non-stationary stochastic objectives, separating two regimes.
result Characterizes the tradeoff between noise and drift in Adam and SGD, revealing when adaptive step-sizing is beneficial or harmful.
Three-hidden-layer neural networks can approximate Hölder continuous functions uniformly with exponential rate.
problem Approximating Hölder continuous functions with neural networks.
method Introduced Floor-Exponential-Step (FLES) networks with three hidden layers.
result Uniform approximation of Hölder continuous functions with an exponential rate.
We propose a novel methodology, forest floor, to visualize and interpret random forest (RF) models. RF is a popular and useful tool for non-linear multi-variate classification and regression, which yields a good trade-off between robustness (low variance) and adaptiveness (low bias). Direct interpretation of a RF model…
Stochastic differential equation approximation for linear TD(0) under Markovian noise
problem Temporal-difference learning with linear function approximation
method Stochastic differential equation approximation
result Explains the constant-stepsize error floor
New model estimates indoor radon distribution with higher spatial resolution.
problem Accurate estimation of indoor radon concentration for health assessment.
method Quantile regression forest and probabilistic Monte Carlo sampling.
result Approximate lognormal distribution of indoor radon in Germany with specific exceedance probabilities.
TASID learns policies in high-dimensional settings with abstract simulator knowledge.
problem RL in high-dimensional settings with limited observation knowledge.
method TASID algorithm for transfer RL from abstract simulator with bounded perturbations.
result Sample complexity polynomial in horizon, independent of number of states.
Newly available data on the spatial distribution of retail activities in cities makes it possible to build models formalized at the level of the single retailer. Current models tackle consumer location choices at an aggregate level and the opportunity new data offers for modeling at the retail unit level lacks a theore…
This paper analyzes M-estimators under infinite-variance noise in high dimensions.
problem High-dimensional M-estimation with infinite-variance noise.
method Study of the Fenchel conjugate domain and its impact on risk.
result Exact risk of M-estimators under infinite-variance noise is derived.
The genus of knots is a one of the fundamental invariant and can be seen as a complexity of knots. In this paper, we give a lower bound of genus using Dehornoy floor, which is a measure of complexity of braids in terms of braid ordering.
AdaQuantFL reduces communication in federated learning by adaptively quantizing model updates.
problem Efficient communication of model updates in federated learning with high-dimensional models and limited bandwidth.
method AdaQuantFL uses adaptive quantization to reduce the number of bits for model updates while maintaining low error floor.
result AdaQuantFL converges in fewer communicated bits compared to fixed quantization levels, with minimal impact on accuracy.
A Common Market Measure for Libor and Pricing Caps, Floors and Swaps in a Field Theory of Forward Interest Ratesphysics.soc-ph
The main result of this paper that a martingale evolution can be chosen for Libor such that all the Libor interest rates have a common market measure; the drift is fixed such that each Libor has the martingale property. Libor is described using a field theory model, and a common measure is seen to be emerge naturally f…
SAEs struggle with curved activation manifolds, revealing layer-dependent scaling laws.
problem Sparse autoencoders' reconstruction error varies across layers, not fitting existing scaling laws.
method Cross-layer study of 844 SAE checkpoints, fitting and regressing on manifold geometry.
result Manifold geometry predicts layer-dependent width exponents in SAEs, with transferable coefficients.
SREC markets are a relatively novel market-based system to incentivize the production of energy from solar means. A regulator imposes a floor on the amount of energy each regulated firm must generate from solar power in a given period and provides them with certificates for each generated MWh. Firms offset these certif…
We investigate the application of two heuristic methods, genetic algorithms and tabu/scatter search, to the optimisation of realistic portfolios. The model is based on the classical mean-variance approach, but enhanced with floor and ceiling constraints, cardinality constraints and nonlinear transaction costs which inc…
Identifying current and future informal regions within cities remains a crucial issue for policymakers and governments in developing countries. The delineation process of identifying such regions in cities requires a lot of resources. While there are various studies that identify informal settlements based on satellite…
Fast, Reliable, and Error-Bounded Option Pricing with Pretrained Neural Networks: A GJR--GARCH Studyq-fin.CP
Fast, reliable, and error-bounded option pricing with neural networks
problem Fast, reliable, and error-bounded option pricing
method Mixture Density Network
result Out-of-sample CDF error of
Optimal portfolio tracking with dynamic capital injection into a ratcheting benchmark.
problem Optimizing a portfolio's performance by dynamically adding capital to a non-decreasing benchmark.
method Formulated as an unconstrained control problem with a running maximum cost, transformed into an auxiliary problem with a nonlinear HJB equation, solved using probabilistic representation and stochastic flow analysis.
result Established the existence of a unique classical solution to the HJB equation, providing feedback optimal portfolio strategies.
The study reveals fundamental limits of fraud detection in card payment networks.
problem Fraud detection in card payment networks is challenging due to structural information impairments.
method Formalized card authorization as a sequential decision problem with delayed feedback, derived minimax regret lower bound.
result Improving issuer reporting quality or reducing censorship can yield larger reductions in the regret floor than increasing model complexity.
AEA dynamically aggregates ensemble targets for actor-critic learning.
problem Static ensemble aggregation methods struggle with overestimation bias and variance.
method Adaptive Ensemble Aggregation (AEA) dynamically constructs ensemble-based targets.
result AEA converges to optimal variance reduction and maximal Fisher information.