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

12243547 · Jun 202019922001200920172026
48 results for Floor Plans

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.

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.

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.

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…

2018-10-13abs ↗pdf ↗

Paper proposes a graph model for optimal AP deployment in indoor optical wireless networks.

problem Challenges in deploying optical wireless networks due to LoS requirement and limited range.
method Graph modeling approach to identify minimum number of APs and their optimal locations.
result Optimal deployment of APs ensures connectivity and minimizes interference in indoor environments.

Spatial and visual connectivity are important metrics when developing workplace layouts. Calculating those metrics in real-time can be difficult, depending on the size of the floor plan being analysed and the resolution of the analyses. This paper investigates the possibility of considerably speeding up the outcomes of…

2019-12-29abs ↗pdf ↗

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…

2020-01-17abs ↗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.

In this paper we consider three types of embedded options in pension benefit design. The first is the Florida second election (FSE) option, offered to public employees in the state of Florida in 2002. Employees were given the option to convert from a defined contribution (DC) plan to a defined benefit (DB) plan at a ti…

2017-08-14abs ↗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 ↗

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.

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 ↗

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.

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.

Study on-chain peak shaving to reduce Ethereum transaction costs.

problem Reducing transaction costs in blockchain networks, especially during congested periods.
method Analyzing transaction-level data from multiple firms across various industries to understand scheduling responses and cost management strategies.
result Firms' scheduling responses to congestion vary, leading to different fee savings and residual costs.

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 ↗

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…

2019-10-04abs ↗pdf ↗

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…

2016-05-30abs ↗pdf ↗

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.

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.

This paper improves indoor positioning accuracy by deploying reference nodes to ensure Line-of-Sight.

problem Systematic bias errors in indoor positioning due to non-LoS propagation.
method Model indoor service area as a graph, partition into cliques for reference nodes, set minimum distance and angle parameters.
result Guaranteed LoS to reference nodes improves indoor positioning accuracy and precision.

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 ↗

Optimizes retirement spending and asset allocation to maximize withdrawals and shortfall.

problem Risk of depleting retirement savings with constant withdrawal rules.
method Dynamic asset allocation to maximize weighted EW and ES.
result Dynamic strategy outperforms constant withdrawal and asset allocation rules.

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 ↗

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.

Study integrates reliability constraints into generation planning models.

problem Challenges in integrating reliability constraints with generation planning models.
method Leverages a weighted oblique decision tree (WODT) technique to embed reliability verification constraints.
result Demonstrates effectiveness in achieving reliable and optimal planning solutions.

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

New approach improves black-box planning efficiency by discovering focused macros.

problem Difficulty of deterministic planning increases exponentially with depth.
method Discovering macro-actions with focused effects to improve goal-count heuristics.
result Focused macros dramatically improve black-box planning efficiency.