Placeto learns efficient device placements for any neural network graph.
problem Finding efficient device placements for neural network training.
method Reinforcement learning approach with iterative placement improvements and graph embeddings.
result Placeto requires up to 6.1x fewer training steps and generalizes to unseen graphs.
DDR game charts generated from raw audio tracks.
problem Creating new step charts for songs without existing charts.
method Combining recurrent and convolutional neural networks for step placement and a conditional LSTM for step selection.
result Improved step charts generated from raw audio tracks.
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.
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.
Algorithm selects important vertices for estimating function means and MSE.
problem Expensive function evaluations; random sampling ignores data structure.
method Greedy coreset selection algorithm with weighted vertices.
result Provably bounds estimation error based on selected vertices.
Study optimal stock order placement in a diffusive market.
problem Optimal placement of a small order in a diffusive limit order book.
method Characterization of optimal limit order placement policy, analysis of behavior under different market conditions, and a simple method to approximate critical time and optimal order placement.
result Existence of a critical time t0 such that for t > t0, optimal placement differs from the best bid and second best bid.
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.
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…
Two clustering algorithms optimize edge controller placement in wireless networks.
problem Optimizing edge controller placement in wireless edge networks.
method Deterministic annealing based clustering algorithms ECP-LL and ECP-LB.
result The algorithms achieve better balance between synchronization and delay costs.
A framework for improving reward prediction in contextual bandits.
problem Improving reward prediction in contextual bandits with side information.
method Upper confidence bound-based multi-task learning algorithm for contextual bandits.
result Established a regret bound quantifying task similarity advantages.
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.
Efficient method improves neural network device placement.
problem Challenging task of placing operations on suitable devices in neural networks.
method End-to-end scalable sequential attention mechanism over graph neural network.
result 16% improvement over human experts and 9.2% over prior art.
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.
Neural network ensembles predict design rule violations from early stages of IC design.
problem Predicting design rule violations from placement and global routing stages in IC design.
method Proposes a framework using neural network ensembles with soft voting and PCA-based subset selection.
result Significant improvement in model performance compared to baseline, including better performance than random forest.
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.
Paper proposes Q-learning for efficient aerial BS placement to improve fairness in mobile networks.
problem Optimal placement of aerial base stations to enhance fairness in a dynamic user mobility environment.
method Reinforcement learning approach to solve the NP-hard problem of 3D placement.
result Simulation results show increased fairness among users with a reasonable computing time and solution close to optimal.
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.
The study compares how deletions and trades affect stock prices and spread changes.
problem Understanding the impact of deletions and trades on stock prices and spread changes.
method Examined the frequencies of relative amounts of price changing events due to trades, deletions, and order placements.
result Deletions of orders open the bid-ask spread more often than trades and have a similar effect on prices as trades.
The study examines order flow patterns in NASDAQ stocks, finding that limit order placement inside the spread is influenced by spread dynamics.
problem Understanding the dynamics of order flow in NASDAQ stocks.
method Analysis of order flow data for different NASDAQ stocks, focusing on limit orders, market orders, and their placement.
result Limit order placement inside the spread is strongly influenced by spread dynamics, while most orders are placed outside the spread.
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.
New method for adaptive sensor placement in continuous spaces reduces detection error.
problem Adaptive sensor placement for detecting stochastic events in continuous intervals.
method Combining Thompson sampling with nonparametric inference via Bayesian histograms.
result Derives an O(T2/3) bound on Bayesian regret, demonstrating efficiency in simulations. A new first-order sampler improves diffusion probabilistic model sampling quality.
problem The belief that first-order methods are inherently slower for diffusion probabilistic model sampling.
method A novel training-free, first-order sampler that approximates the forward-value evaluation via a one-step lookahead predictor.
result The proposed sampler provably approximates the ideal forward-value trajectory while retaining first-order convergence and can improve sample quality under the same NFE budget.
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.
Paper proposes an ensemble classifier for balanced MBA selection data.
problem Learning from imbalanced data in MBA selection.
method Imbalanced ensemble classifier for feature selection and classification.
result Higher accuracy in predicting MBA placements from imbalanced data.
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.
New sensor placement affects robot controller learnability.
problem Catastrophic forgetting in neural controllers for robots.
method Demonstrated how sensor placement alters loss function manifolds.
result Sensor placement can reduce or induce catastrophic forgetting.
Deep learning optimizes sensor placement for efficient 3D mapping.
problem Efficiently mapping unknown 3D environments with minimal sensor measurements.
method Supervised learning of a greedy algorithm using a convolutional neural network.
result The method reduces computational cost and finds near-optimal vantage points.
The paper explores how latency affects limit order placement and adverse selection risk.
problem Limit order placement and adverse selection risk.
method Stochastic control framework to exploit liquidity imbalance and measure latency impact.
result The added value of exploiting liquidity imbalance is reduced by latency.
Study develops machine learning model to predict component movement during reflow in SMT.
problem Inaccurate self-alignment of components during reflow process in SMT leads to defects.
method Experimental data analysis followed by advanced machine learning models (SVR, NN, RFR) to predict component shift in x, y, and rotational directions.
result Random forest regression (RFR) model predicts component shift with high accuracy and low error.
DeepPlace learns to place applications in clusters using RL.
problem Manual placement rules for scheduling are non-trivial and suboptimal.
method Uses Deep Reinforcement Learning to learn optimal placement rules.
result Reduces resource competition and optimizes cluster utilization.
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.
Explains financial market simulation mechanisms and agent behaviors.
problem Necessity of including fundamental value in multiagent financial market simulations.
method Discusses three methods for generating fundamental value and illustrates one Bayesian agent's estimation process.
result Presentation of two widely examined agents: Zero Intelligence and Heuristic Belief Learning.
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.
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.
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.
Modeling aggressive market order arrivals using Hawkes factor models.
problem Aggressive market order placements and their impact on stock prices.
method Bivariate marked Hawkes process with self-excitation and cross-excitation components.
result The Hawkes model with an exponential kernel produces better calibration than a monotonous exponential kernel.
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…