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

Trend · papers per month

17335066 · Jun 202019922001200920172026
48 results for 2D 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.

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.

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.

PBCS combines RL and motion planning for better exploration.

problem RL algorithms struggle with versatile exploration in complex environments.
method PBCS uses motion planning to find a good trajectory, then trains RL on a curriculum derived from it.
result PBCS outperforms state-of-the-art RL algorithms in 2D maze environments.

Fast and efficient motion planning algorithms are crucial for many state-of-the-art robotics applications such as self-driving cars. Existing motion planning methods become ineffective as their computational complexity increases exponentially with the dimensionality of the motion planning problem. To address this issue…

2018-06-14abs ↗pdf ↗

This paper proposes grid cells encode position via a conformal isometric embedding of 2D physical space.

problem Hexagonal grid firing patterns in grid cells.
method Learning a distance-preserving position embedding in neural space using a recurrent neural network.
result The conformal isometric embedding of 2D physical space into neural space explains hexagonal grid firing patterns.

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.

2D path planning in static environment is a well-known problem and one of the common ways to solve it is to 1) represent the environment as a grid and 2) perform a heuristic search for a path on it. At the same time 2D grid resembles much a digital image, thus an appealing idea comes to being -- to treat the problem as…

2019-08-05abs ↗pdf ↗

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 ↗

Paper tackles continual reinforcement learning by forgetting, proposing a planning method with online world models.

problem Catastrophic forgetting in reinforcement learning when learning new tasks.
method Planning with an online world model using model predictive control.
result The proposed FTL Online Agent (OA) learns new tasks without forgetting old skills.

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 ↗

Bayesian segmentation and uncertainty estimation improve 3D model accuracy for factory planning.

problem Generating accurate 3D models from outdated and incomplete 2D data.
method Bayesian neural network for point cloud segmentation and entropy-based uncertainty estimation.
result Bayesian segmentation network significantly improves model accuracy and object identification.

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.

Paper tackles efficient navigation in constrained environments using supervised and reinforcement learning.

problem Building learning agents that efficiently navigate in obstacle-cluttered environments.
method Synergistic use of supervised learning for path prediction and reinforcement learning for path following.
result Proposed method achieves good generalization and faster learning compared to existing work.

Navigated 2D multi-slice dynamic Magnetic Resonance (MR) imaging enables high contrast 4D MR imaging during free breathing and provides in-vivo observations for treatment planning and guidance. Navigator slices are vital for retrospective stacking of 2D data slices in this method. However, they also prolong the acquisi…

2018-04-12abs ↗pdf ↗

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.

PHASE dataset simulates complex social interactions in physical environments.

problem Lack of datasets for evaluating physically grounded perception of complex social interactions.
method Created PHASE dataset of 2D animations with procedural generation and physics engine.
result SIMPLE model outperforms neural networks in recognizing complex social interactions.

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.

AI enhances refinery optimization by detecting data errors and improving decision-making.

problem Interpreting and applying LP solutions for refinery optimization is challenging due to simplifications and data errors.
method Transformed ECOD methodology, Anomaly Detection tools, and high-dimensional data analysis.
result Identifies data supply errors and reveals business opportunities in refinery scheduling and planning.

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.