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

99197296394 · Jun 202019922001200920182026
48 results for floor classification

Paper proposes a SIMO DNN for indoor localization using Wi-Fi fingerprints.

problem Indoor localization with high accuracy and efficiency.
method Single-input and multi-output deep neural network architecture.
result SIMO-DNN scheme outperforms existing methods in floor detection and location accuracy.

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.

The relationships between braid ordering and the geometry of its closure is studied. We prove that if an essential closed surface FF in the complements of closed braid has relatively small genus with respect to the Dehornoy floor of the braid, FF is circular-foliated in a sense of Birman-Menasco's Braid foliation the…

2008-05-10abs ↗pdf ↗

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 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…

2016-05-30abs ↗pdf ↗

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…

2006-01-25abs ↗pdf ↗

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…

2018-02-24abs ↗pdf ↗

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.

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.

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.

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.

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.

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 b1<b2b_1 < b_2 such that all non-trivial exceptional surgeries occur in the interval [b1,b2][b_1, b_2]. The integers in $[\ceil{b_1}, \floor{b_2}]$ are all exceptional surgeries.

Trading strategies improved by classifying financial time-series images.

problem Improving financial trading strategies using image classification.
method Created a dataset of financial time-series images, labeled them, and trained machine learning models.
result Machine learning models trained on image data outperformed traditional time-series analysis.

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.

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.

Paper proposes RL for efficient dispatching in dynamic manufacturing environments.

problem Efficient dispatching in dynamic, stochastic manufacturing environments.
method Reinforcement learning (RL) with policy transfer for dynamic shop floor settings.
result Proposed RL approach outperforms other methods in terms of total discounted reward and average lateness, tardiness.

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.

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…

2016-12-16abs ↗pdf ↗

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.

2008-05-14abs ↗pdf ↗

Deep RL policies can leak private information from trained policies.

problem Privacy leakage in deep reinforcement learning models.
method Environment dynamics search via genetic algorithm and candidate inference based on shadow policies.
result 95.83% average recovery rate of floor plans from trained Grid World navigation DRL agents.

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.

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\).

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.

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…

2005-01-04abs ↗pdf ↗

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.

Optimal solar energy production and trading strategies in SREC markets identified.

problem Optimizing solar energy production and trading in SREC markets.
method Formulated a stochastic control problem, accounting for generation and trading costs, and developed a numerical algorithm to solve the control problem.
result An optimal firm's generation and trading behavior can be separated into various regimes based on the marginal benefit of obtaining an additional SREC.

A study on the depth of graph neural networks on sparse graphs, revealing a dichotomy based on the Kesten-Stigum ratio.

problem Determining the optimal depth of graph neural networks for sparse graphs.
method Analyzing the sparse contextual stochastic block model with a message-passing classifier.
result The value of depth is governed by the Kesten-Stigum ratio, with thresholds dividing performance into geometric and branching processes.

Cumulant expansion is used to derive accurate closed-form approximation for Monthly Sum Options in case of constant volatility model. Payoff of Monthly Sum Option is based on sum of NN caped (and probably floored) returns. It is noticed, that 1/N1/\sqrt{N} can be used as a small parameter in Edgeworth expansion. First …

2010-11-17abs ↗pdf ↗

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.

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.

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.

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.