Paper proposes TRA to learn multiple stock trading patterns.
problem Inconsistent i.i.d. assumption limits stock prediction performance.
method TRA architecture with Optimal Transport for pattern assignment.
result Improves information coefficient (IC) by 0.04-0.06 compared to baselines.
Shape adaptor learns flexible resizing factors for neural networks.
problem Fixed resizing layers limit network performance.
method Learnable reshaping factor for traditional resizing layers.
result Performance increases consistently across multiple datasets.
STAD improves travel time estimation by learning from real traffic data.
problem Travel time estimation using GPS traces is inaccurate and requires offline optimization.
method STAD uses machine learning and real-time trip data to adjust travel time estimates.
result STAD reduces median absolute errors by 14% in Doha and New York City, and 29% in Porto.
The paper predicts travel times using tree-based ensembles.
problem Predicting travel times between urban points over short and long horizons.
method Tree-based ensemble methods trained on taxi trip records with additional features from weather and routing data.
result Adding routing data improves model performance and short-term predictions require less data.
Adaptor 'E' extends gradient-based optimizers to explore loss landscapes, improving generalization.
problem Finding lower and better-generalizing minima in deep learning.
method Proposes an adaptor 'E' to extend gradient-based optimizers, encouraging exploration along landscape valleys.
result Adapted optimizers increase test accuracy by an average of 2.5% in large-batch training tasks.
LG algorithm finds profitable trading paths in decentralized exchanges.
problem Identifying optimal trading paths in decentralized exchanges.
method Line-graph-based algorithm (LG) for efficient route discovery.
result LG consistently identifies more profitable paths than DFS with comparable costs.
Efficient sparse attention reduces self-attention complexity and improves model performance.
problem Quadratic compute and memory requirements of self-attention for long sequences.
method Content-based sparse attention with dynamic routing module.
result Routing Transformer achieves state-of-the-art performance on various benchmarks.
MM-DREX adapts LLM experts for financial trading via dynamic routing.
problem Challenges of non-stationary financial markets and static expert designs.
method MM-DREX uses a VLM-powered dynamic router to allocate expert weights and designs heterogeneous trading experts.
result Significantly outperforms 15 baselines across key metrics.
Machine learning struggles with temporal data in finance, leading to inaccurate models.
problem Machine learning models struggle with temporal data in finance, leading to inaccurate predictions.
method Review and critique current machine learning approaches for temporal data in finance.
result Current approaches to machine learning in finance often ignore the temporal richness of data.
Method estimates travel times on urban roads using Uber data.
problem Estimating travel times on urban roads where data is scarce.
method Graph representation, trip sampling, least-squares optimization.
result Estimates travel times on arterial roads using aggregated Uber data.
Capsule networks improve performance on image classification tasks with fewer parameters.
problem Improving performance of capsule networks with fewer parameters.
method Inverted dot-product attention routing, Layer Normalization, concurrent iterative routing.
result Improves performance on benchmark datasets CIFAR-10 and CIFAR-100, and performs at-par with ResNet-18.
Route Choice Models predict the route choices of travelers traversing an urban area. Most of the route choice models link route characteristics of alternative routes to those chosen by the drivers. The models play an important role in prediction of traffic levels on different routes and thus assist in development of ef…
JAMPR learns to solve complex VRP with time windows.
problem Vehicle routing problems with time windows and vehicle capacities.
method Joint attention to construct multiple routes concurrently.
result JAMPR outperforms existing models on different problem sizes.
EHNA learns node embeddings from historical network neighborhoods.
problem Capturing temporal information in evolving networks.
method Temporal random walk and deep learning model with attention mechanism.
result EHNA outperforms existing methods in network reconstruction and link prediction tasks.
A large GPS dataset reveals that a single route often covers 60% of travel observations.
problem Limited insights from small GPS datasets on route choice behavior.
method Evaluation of path generation algorithms including link penalty, link elimination, simulation, and via-node methods.
result Modified link penalty method achieves 97% coverage, significantly higher than previous studies.
Global routing has been a historically challenging problem in electronic circuit design, where the challenge is to connect a large and arbitrary number of circuit components with wires without violating the design rules for the printed circuit boards or integrated circuits. Similar routing problems also exist in the de…
We propose and systematically evaluate three strategies for training dynamically-routed artificial neural networks: graphs of learned transformations through which different input signals may take different paths. Though some approaches have advantages over others, the resulting networks are often qualitatively similar…
A new router uses attention-based reinforcement learning to solve detailed routing problems efficiently.
problem Solving detailed routing in integrated circuits while adhering to complex design rules.
method Attention-based reinforcement learning applied to track-assignment detailed routing.
result The attention router achieves over 100x acceleration compared to a genetic router without sacrificing solution quality.
The DEBS Grand Challenge 2018 is set in the context of maritime route prediction. Vessel routes are modeled as streams of Automatic Identification System (AIS) data points selected from real-world tracking data. The challenge requires to correctly estimate the destination ports and arrival times of vessel trips, as ear…
Unified routing and arbitrage with concave continuation.
problem Combining routing and arbitrage in financial markets.
method Extending AMM trade functions to negative inputs via concave continuation.
result Unified approach unifies routing and arbitrage.
A new approach integrates inventory prediction and routing optimization for better supply chain management.
problem Optimizing efficient route selection in supply chain management with uncertain inventory demand.
method Decision-focused learning approach using neural networks to directly integrate inventory prediction and routing optimization.
result Direct integration of inventory prediction and routing optimization leads to better supply chain decisions.
The study introduces measures of collective mobility from aggregated OD data.
problem Understanding large-scale mobility patterns from aggregated data.
method Developed a framework using synthetic and real data to interpret network-level mobility.
result Aggregated mobility measures reveal network structure and flow constraints.
Sparse routing networks with co-training prevent catastrophic forgetting in continual learning.
problem Catastrophic forgetting in neural networks trained on a sequence of tasks.
method Sparse routing networks with co-training to minimize interference between dissimilar tasks.
result Sparse routing networks with co-training outperform densely connected networks on benchmarks.
A recently proposed method in deep learning groups multiple neurons to capsules such that each capsule represents an object or part of an object. Routing algorithms route the output of capsules from lower-level layers to upper-level layers. In this paper, we prove that state-of-the-art routing procedures decrease the e…
Polestar optimizes public transportation routes for efficiency and user satisfaction.
problem Difficulty in finding optimal public transportation routes due to complex networks and dynamic situations.
method Developed a Public Transportation Graph (PTG) and a route search algorithm with station binding and ranking modules.
result Demonstrated superior efficiency and user satisfaction compared to existing systems.
Capsules are the multidimensional analogue to scalar neurons in neural networks, and because they are multidimensional, much more complex routing schemes can be used to pass information forward through the network than what can be used in traditional neural networks. This work treats capsules as collections of neurons …
Capsule networks improve at detecting changes in compositionality with routing.
problem Capsule networks struggle with detecting changes in compositionality.
method Introduced a loss function based on routing entropy to improve compositionality.
result Capsule networks with the new loss function better detect changes in compositionality.
Optimizes query routing to LLMs under cost and resource constraints.
problem Non-uniform or adversarial batching in per-query routing methods leads to cost inefficiency.
method Batch-level, resource-aware routing framework that jointly optimizes model assignment for each batch.
result Robust routing framework improves accuracy by 1-14% over non-robust methods.
Study finds average 2.02 bps loss in automated market maker routing.
problem Measuring sub-optimality in automated market maker routing.
method Three reproducible optimal benchmarks: SCO, FVO, G-FVO; bisection-based algorithm for optimal routing.
result Average 2.02 bps loss per trade, \$24 million total loss.
CARROT optimizes LLM routing by choosing the cheapest and most accurate model.
problem Optimizing query routing to the most cost-effective LLM for a given task.
method CARROT uses cost and performance estimates to select the best LLM for each query.
result CARROT is minimax optimal, selecting the best LLM for any query.
Enhanced route planning with probabilistic prediction and uncertainty sets.
problem Improving route planning reliability under uncertainty.
method CQR-GAE model integrating conformal prediction and uncertainty sets.
result Significantly outperforms baseline methods in real-world traffic scenarios.
New machine learning pipeline solves dynamic vehicle routing problems efficiently.
problem Efficiently handling same day deliveries in e-commerce logistics.
method Combination of machine learning and combinatorial optimization.
result Ranked first in the EURO Meets NeurIPS Vehicle Routing Competition.
New algorithm for traffic routing in congested conditions.
problem Optimal routing in congested traffic networks.
method Congested Bandits model, UCB algorithm, iterative least squares planner.
result No-regret algorithms for congestion-aware routing.
This study predicts parking availability using multi-source data and a self-supervised learning enhanced transformer.
problem Accurate parking availability prediction to support urban planning and management.
method Proposes SST-iTransformer, a self-supervised learning enhanced spatio-temporal inverted transformer, integrating multi-source data.
result SST-iTransformer achieves state-of-the-art performance in parking availability prediction.
Optimal crypto asset routing with CFMMs, including fixed costs.
problem Optimizing order execution on a network of CFMMs with fixed costs.
method Convex optimization for no fixed costs, mixed-integer convex for fixed costs, heuristics for approximate solutions.
result Approximate solutions to optimal routing and arbitrage certification problems.
DPDP combines neural heuristics with DP for vehicle routing problems.
problem Vehicle routing problems with large scale.
method Deep Policy Dynamic Programming (DPDP) that uses a neural network policy to prioritize and restrict the DP state space.
result DPDP improves upon classical DP algorithms and outperforms neural approaches for TSP, VRP, and TSPTW.
Framework improves ETF volatility forecasting by adapting to market conditions.
problem Challenges in volatility forecasting due to shifting market conditions and varying model performance.
method Risk-sensitive specialist routing using online risk-sensitive evaluation and state-dependent gating.
result Reduces forecast loss by 24% and underprediction loss by 22% compared to rolling-best baseline.
High-level synthesis (HLS) shortens the development time of hardware designs and enables faster design space exploration at a higher abstraction level. Optimization of complex applications in HLS is challenging due to the effects of implementation issues such as routing congestion. Routing congestion estimation is abse…
World wide road traffic fatality and accident rates are high, and this is true even in technologically advanced countries like the USA. Despite the advances in Intelligent Transportation Systems, safe transportation routing i.e., finding safest routes is largely an overlooked paradigm. In recent years, large amount of …
Equity-Transformer solves NP-hard min-max routing problems efficiently.
problem Min-max routing problems with multiple agents and large-scale applications.
method Sequential planning approach with Transformer and equitable workload distribution inductive biases.
result Significant runtime and cost reductions in min-max mTSP and min-max mPDP tasks.
Recently similarity graphs became the leading paradigm for efficient nearest neighbor search, outperforming traditional tree-based and LSH-based methods. Similarity graphs perform the search via greedy routing: a query traverses the graph and in each vertex moves to the adjacent vertex that is the closest to this query…
New system assigns vehicles to routes for cost and energy efficiency.
problem Optimizing vehicle route assignment for cost and energy efficiency.
method Machine learning-based neural network algorithm to estimate energy consumption and provide real-time recommendations.
result Demonstrated efficient vehicle assignment for medium and heavy duty trucks.
New method tackles parcel routing with AI.
problem Routing parcels efficiently through a network of hubs.
method Combines graph neural networks with model-free RL.
result Extracts small feature graphs from the environment state.
Two heuristics solve dynamic multiple travelling salesmen problems.
problem Dynamic routing with unknown customers.
method Balanced dynamic closest vehicle heuristic and balanced dynamic assignment vehicle heuristic.
result Continuous approximation models for strategic dynamic routing.
Sparse RSP routing improves graph exploration and classification.
problem Optimal randomized routing and distance measures on weighted graphs.
method Tsallis divergence regularization for sparse RSP.
result Sparse random walk converges to least-cost graph as temperature decreases.
In this paper we introduce a new inductive bias for capsule networks and call networks that use this prior γ-capsule networks. Our inductive bias that is inspired by TE neurons of the inferior temporal cortex increases the adversarial robustness and the explainability of capsule networks. A theoretical framework with…
Simultaneously estimates travel times and route choice model parameters.
problem Interdependent estimation of arc travel times and route choice model parameters.
method Maximum likelihood estimation for any differentiable route choice model.
result Strong performance in real-world data, even compared to arc travel time estimation methods.
This paper introduces STAP to measure DEX efficiency and shows better routing algorithms increase DEX performance and stakeholder benefits.
problem Measuring and improving the efficiency of decentralized exchanges (DEXs).
method Introduces STAP as a measure of DEX efficiency and compares two routing algorithms.
result Better routing algorithms improve DEX efficiency and stakeholder benefits.