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.
In this paper, we use an aerial base station (aerial-BS) to enhance fairness in a dynamic environment with user mobility. The problem of optimally placing the aerial-BS is a non-deterministic polynomial-time hard (NP-hard) problem. Moreover, the network topology is subject to continuous changes due to the user mobility…
We present Placeto, a reinforcement learning (RL) approach to efficiently find device placements for distributed neural network training. Unlike prior approaches that only find a device placement for a specific computation graph, Placeto can learn generalizable device placement policies that can be applied to any graph…
PLoP optimizes LoRA placement for efficient large model finetuning.
problem Improving efficiency of LoRA adaptation for large models.
method Intuitive theoretical analysis for automatic adapter placement.
result PLoP consistently outperforms existing placement strategies.
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…
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.
A new model approximates complex functions in parameter space.
problem Complex and nonlinear functional regression problems.
method Mapping-to-Parameter function model with B-spline free knot placement.
result Robust knot placement algorithms improve model performance.
Paper uses machine learning to optimize VNF placement for reduced delay.
problem Optimizing VNF placement for reduced delay and cost.
method Developed a machine learning decision tree model to learn from VNF placement data.
result Model reduces delay between VNF instances and across SFC.
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.
The paper improves marine buoy placement to detect ships robustly against disruptions.
problem Detecting fishing vessels in the presence of natural and man-made disruptions.
method Formulated as a clustering problem, used dropout k-means and k-median to improve buoy placement robustness.
result Improved ship detection probability with dropout k-means compared to classic methods.
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…
Paper proposes a COP model for Algo trading using LQR.
problem Complexities in child order placement in Algo trading.
method Stochastic LQR model for passive limit orders and aggressive takeout orders.
result Closed-form solutions for optimal child order placement.
Optimizes chip component placement with self-alignment for SMT technology.
problem Achieving precise component placement on PCB during SMT process.
method Proposed machine learning algorithms (SVR and RFR) to predict component positions and developed non-linear optimization model.
result RFR model outperforms in predicting component positions before reflow.
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…
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…
We observe the effects of the three different events that cause spread changes in the order book, namely trades, deletions and placement of limit orders. By looking at the frequencies of the relative amounts of price changing events, we discover that deletions of orders open the bid-ask spread of a stock more often tha…
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 …
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.
In this work we introduce two novel deterministic annealing based clustering algorithms to address the problem of Edge Controller Placement (ECP) in wireless edge networks. These networks lie at the core of the fifth generation (5G) wireless systems and beyond. These algorithms, ECP-LL and ECP-LB, address the dominant …
Study improves cancer classification using gene selection and projection methods.
problem Overfitting in high-dimensional microarray datasets for cancer classification.
method FSWOR technique, random projection, Kendall test, ensemble classifiers, LDA projection, Naïve Bayes.
result Achieved a test score of 96%, significantly outperforming existing methods.
We study the relaxation dynamics of the bid-ask spread and of the midprice after a sudden, large variation of the spread, corresponding to a temporary crisis of liquidity in a double auction financial market. We find that the spread decays very slowly to its normal value as a consequence of the strategic limit order pl…
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.
Private business schools in India face a common problem of selecting quality students for their MBA programs to achieve the desired placement percentage. Generally, such data sets are biased towards one class, i.e., imbalanced in nature. And learning from the imbalanced dataset is a difficult proposition. This paper pr…
In a number of situations, collecting a function value for every data point may be prohibitively expensive, and random sampling ignores any structure in the underlying data. We introduce a scalable optimization algorithm with no correction steps (in contrast to Frank-Wolfe and its variants), a variant of gradient ascen…
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…
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.
We introduce a fully probabilistic framework of consumer product choice based on quality assessment. It allows us to capture many aspects of marketing such as partial information asymmetry, quality differentiation, and product placement in a supermarket.
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.
We show that the statistics of spreads in real order books is characterized by an intrinsic asymmetry due to discreteness effects for even or odd values of the spread. An analysis of data from the NYSE order book points out that traders' strategies contribute to this asymmetry. We also investigate this phenomenon in th…
This paper is split in three parts: first we use labelled trade data to exhibit how market participants accept or not transactions via limit orders as a function of liquidity imbalance; then we develop a theoretical stochastic control framework to provide details on how one can exploit his knowledge on liquidity imbala…
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.
Optimizes web publisher revenues from RTB auctions.
problem Maximizing revenue from RTB auctions with limited information.
method Incremental time-weighted matrix factorization for user and placement profiles; Aalen's Additive model for censored bid predictions.
result Significant revenue increase for web publishers.
Trains a neural network to predict high-frequency trading outcomes.
problem Predicting the fill probability function for high-frequency trading.
method High-quality high-frequency data and neural network training with a weighted loss function.
result Strong state dependence properties of the fill probability function.
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 L2 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…
Study analyzes order transitions in high, medium, and low market cap stocks using Markov chains.
problem Understanding order transitions in stocks of different market caps.
method First-order discrete-time Markov chain model applied to NASDAQ100 stocks.
result Limit orders exhibit higher inertia during opening hours but decrease in subsequent hours, while market orders increase.
RL framework optimizes trading costs in noisy markets.
problem Optimal execution and placement in noisy markets.
method Dual-window Denoise PPO RL network, imitation learning, comprehensive market features, flexible action formulation.
result RL agents outperformed TWAP strategy in execution cost.