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

8.3%16.7%25.0%33.3% · Jan 199319922001200920172026
48 results for Precise Placement

ConvGNP improves sensor placement for climate monitoring.

problem Maximizing informativeness of environmental sensor placements in remote regions.
method Convolutional Gaussian neural processes (ConvGNP) for non-stationary spatial predictions.
result ConvGNP outperforms traditional GP models in predicting sensor performance and reducing uncertainty.

We study the optimal placement problem of a stock trader who wishes to clear his/her inventory by a predetermined time horizon t, by using a limit order or a market order. For a diffusive market, we characterize the optimal limit order placement policy and analyze its behavior under different market conditions. In part…

2017-08-14abs ↗pdf ↗

New approach uses secants to improve sensor placement and feature selection for nonlinear systems.

problem Inadequacy of linear methods for minimal sensor placement and feature selection in nonlinear systems.
method Data-driven approach using secant vectors to develop greedy algorithms for robust, near-minimal reconstruction guarantees.
result Demonstrated on two problems where linear techniques fail, secant-based approach provides robust solutions.

Paper proposes efficient UAV placement for aerial base stations.

problem Efficient placement of UAVs as aerial base stations to serve varying traffic demand.
method Modeling UAV deployment as a non-cooperative game and using a learning-based algorithm to update UAV locations.
result Significant performance gains up to 52% and 74% in terms of throughput and dropped users compared to an optimized baseline algorithm.

BALLAST optimizes Lagrangian observer placement for ocean vector fields.

problem Optimizing Lagrangian observer placement for time-dependent ocean vector fields.
method Bayesian active learning with look-ahead amendment for sea-drifter trajectories using a physics-informed spatio-temporal Gaussian process surrogate model.
result Noticeable benefits of BALLAST-aided observer placement strategies on synthetic and high-fidelity ocean models.

New method optimizes sensor placement for stochastic systems efficiently.

problem Optimizing sensor placements for black-box stochastic systems with computational constraints.
method Trains a joint energy-based model on simulation data to learn parameter and solution distributions, allowing efficient sensor placement.
result Demonstrates lower computational cost and more informative sensor locations compared to conventional approaches.

Optimal wind farm placement using quantile constraints for better power output.

problem Optimizing wind farm placement to maximize power output considering spatial and temporal wind speed correlations.
method Used a probabilistic neural network with ReLU activation functions to reformulate constraints as linear ones, embedding them into a two-stage stochastic optimization problem.
result The constraint learning approach outperforms classical methods, especially for risk-averse investors.

To execute a trade, participants in electronic equity markets may choose to submit limit orders or market orders across various exchanges where a stock is traded. This decision is influenced by the characteristics of the order flow and queue sizes in each limit order book, as well as the structure of transaction fees a…

2012-10-05abs ↗pdf ↗

Using ultra-high-frequency data extracted from the order flows of 23 stocks traded on the Shenzhen Stock Exchange, we study the empirical regularities of order placement in the opening call auction, cool period and continuous auction. The distributions of relative logarithmic prices against reference prices in the thre…

2007-12-06abs ↗pdf ↗

Study optimizes sensor placement for accurate parameter estimation in complex systems.

problem Challenges in parameter estimation with limited or noisy data.
method Physics-Informed Neural Networks (PINNs) for optimal sensor placement and parameter estimation.
result PINNs-based framework achieves higher accuracy in parameter estimation compared to random sensor placements.

Runtime and scalability of large neural networks can be significantly affected by the placement of operations in their dataflow graphs on suitable devices. With increasingly complex neural network architectures and heterogeneous device characteristics, finding a reasonable placement is extremely challenging even for do…

2019-09-28abs ↗pdf ↗

Marine buoys aid in the battle against Illegal, Unreported and Unregulated (IUU) fishing by detecting fishing vessels in their vicinity. Marine buoys, however, may be disrupted by natural causes and buoy vandalism. In this paper, we formulate marine buoy placement as a clustering problem, and propose dropout k-means an…

2020-01-02abs ↗pdf ↗

We identify and analyze statistical regularities and irregularities in the recent order flow of different NASDAQ stocks, focusing on the positions where orders are placed in the orderbook. This includes limit orders being placed outside of the spread, inside the spread and (effective) market orders. We find that limit …

2017-02-14abs ↗pdf ↗

Study designs neural networks for fault localization, state estimation, and optimal PMU placement in power systems.

problem Fault localization, state estimation, and optimal PMU placement in power systems.
method Designs and compares various neural networks for fault localization, builds machine learning schemes for state estimation and parameter estimation, and designs an algorithm for optimal PMU placement.
result Comprehensive comparison of neural networks for fault localization shows that Graphical Convolutional NN and Neural Graph-based ODE perform best.

Deep RL optimizes sensor placement in digital twins for dynamic data acquisition.

problem Limited applicability of traditional sensor placement techniques for online applications.
method Formulates sensor placement as a Markov decision process and uses deep reinforcement learning.
result Improves predictive accuracy and reliability of digital twins through adaptive sensor repositioning.

Optimal stock trading strategy with market orders and limit orders in a risky market.

problem Finding the best time and amount to place market and limit orders to minimize costs.
method Analyzes single and multi-period models with limit and market orders, considering liquidity risk.
result Optimal placement of market and limit orders can be determined under different market conditions.

Synthesizes sensor likelihoods to enforce accuracy constraints in uncertain systems.

problem Designing sensing architectures for systems with uncertain or unavailable sensor models and accuracy requirements.
method Inverts the design flow, synthesizing measurement likelihoods that minimize Kullback-Leibler divergence from the prior while enforcing an accuracy bound.
result The method synthesizes a maximum-entropy posterior and induced likelihood, accommodating various discrepancy metrics.

A new method selects inducing points to optimize high-throughput Bayesian optimisation.

problem Current inducing point selection methods sacrifice high-fidelity modeling of promising regions.
method Information-theoretic criterion to select inducing points maximizing global and maximum value uncertainties.
result Surrogate models support high-precision high-throughput Bayesian optimisation.

This paper designs sensor arrays for estimating unsteady flows efficiently.

problem Estimating high-dimensional unsteady flow fields with limited sensor placement.
method Combines data-driven modeling, Kalman Filter design, and sparsification for sensor selection.
result Proposed sensor arrays are highly effective for flow-field estimation across various conditions.

This paper optimizes how deep learning models are distributed across different devices.

problem Optimizing how large, complex neural networks are split across multiple devices.
method Identified and solved an optimization problem for device placement of DNN operators.
result Automated algorithms that solve the device placement problem for modern pipelined settings.

Optimal sensor placement minimizes information loss from simulations.

problem Designing efficient sensor networks for spatiotemporal processes.
method Model-based sensor placement criterion with sparse variational inference and Gauss-Markov priors.
result Our method identifies sensor networks that minimize information loss from simulated data.

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.

Although behavioral economics has demonstrated that there are many situations where rational choice is a poor empirical model, it has so far failed to provide quantitative models of economic problems such as price formation. We make a step in this direction by developing empirical models that capture behavioral regular…

2005-09-22abs ↗pdf ↗

NEST optimizes deep learning training by placing devices efficiently across networks and memory.

problem Inefficient device placement in distributed deep learning leads to high communication and memory overhead.
method NEST uses network-, compute-, and memory-aware dynamic programming to optimize device placement.
result NEST achieves up to 2.43 times higher throughput and better memory efficiency.

A new algorithm learns optimal source placement in large networks.

problem Optimizing source placement in large scale networks with unknown processes.
method Graph-Kernel Multi-Armed Bandit (Grab-UCB) algorithm with adaptive graph dictionary model.
result Online learning algorithm outperforms offline methods in terms of cumulative regret, sample efficiency, and computational complexity.

Optimal bidding strategy for multi-platform ad auctions under budget constraints.

problem Optimizing ad placements for budget-constrained advertisers across multiple platforms.
method Developed an optimal bidding strategy for non-incentive-compatible auctions with budget constraints.
result Maximized total utility across auctions while satisfying budget constraints in expectation.

Paper optimizes hyperspherical prototypes for better class separation.

problem Previous HPL approaches either lack principled optimisation or are limited to one latent dimension.
method Develops a principled optimisation procedure and uses linear block codes to create well-separated prototypes in various dimensions.
result Optimal prototype placement is characterized with achievable and converse bounds, showing near-optimality.

Proposes a more efficient knot selection method for sparse Gaussian processes.

problem Optimizing marginal likelihood for knot selection leads to suboptimal and inefficient placement of knots.
method Uses Bayesian optimization to propose knots one at a time, avoiding multimodal surface issues.
result Improves both accuracy and speed of knot selection compared to current methods.

Proposes adaptive ridge regression for functional linear models with piecewise shapes.

problem Functional linear regression with unknown coefficient function.
method Adaptive piecewise function template with L2L_2 penalization.
result Improves predictive power and interpretability compared to standard methods.

Study uses GPLFM to create Digital Twin for ferry quay health monitoring.

problem Deterioration of ferry quays due to harsh maritime environments and impacts.
method Gaussian Process Latent Force Model (GPLFM) integrating physics-based model and machine learning.
result GPLFM provides accurate acceleration response estimates, even under simplifying assumptions.

We extend the concepts of trivializing and knotting numbers for knots to spatial graphs and 2-bouquet graphs, in particular. Furthermore, we calculate the trivializing and knotting numbers for projections and pseudodiagrams of 2-bouquet spatial graphs based on the number of precrossings and the placement of the precros…

2016-07-25abs ↗pdf ↗