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

Trend · papers per month

9172634 · May 202619922001200920172026
48 results for bus routes

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.

The wave equation utt=c2uxxu_{tt} = c^2 u_{xx} is generally regarded as a linear approximation to the equation describing the amplitude of a transversely vibrating elastic string in the plane. But, as is shown in \cite{BC96}, the assumption of transverse vibration in fact implies that the wave equation describes the vibration…

2013-02-27abs ↗pdf ↗

Two novel models predict bus travel times with uncertainty, improving connection assurance.

problem Improving bus connection assurance by handling travel time uncertainty.
method Two novel approaches: Deep Quantile Regression (DQR) and Bayesian Recurrent Neural Networks (BRNN).
result DQR model performs best for 80%, 90%, and 95% prediction intervals, with small underestimation.

Thompson Sampling with bilateral uncertainty improves performance in Bayesian Optimization.

problem Twin difficulties of modeling and searching complex functions in high dimensions.
method Exploiting conditional independence, Thompson Sampling respecting bilateral uncertainty (BU).
result Thompson Sampling with BU is more effective than the additive approximation in small budgets.

The increasing penetration of distributed energy resources poses numerous reliability issues to the urban distribution grid. The topology estimation is a critical step to ensure the robustness of distribution grid operation. However, the bus connectivity and grid topology estimation are usually hard in distribution gri…

2016-11-06abs ↗pdf ↗

Artificial neural network (ANN) provides superior accuracy for nonlinear alternating current (AC) state estimation (SE) in smart grid over traditional methods. However, research has discovered that ANN could be easily fooled by adversarial examples. In this paper, we initiate a new study of adversarial false data injec…

2019-06-26abs ↗pdf ↗

DDSTN improves breast cancer diagnosis by leveraging imbalanced ultrasound modalities.

problem Imbalanced ultrasound modalities in diagnosing breast cancer.
method Integrates LUPI and MMD into a deep transfer learning framework.
result Outperforms state-of-the-art algorithms in BUS-based CAD.

Given a complete, smooth metric measure space (M,g,efdv)(M,g,e^{-f}dv) with the Bakry-Émery Ricci curvature bounded from below, various gradient estimates for solutions of the following general ff-heat equations ut=Δfu+aulogu+bu+Aup+Buq u_t=Δ_f u+au\log u+bu +Au^p+Bu^{-q} and \[ u_t=Δ_f u+Ae^{pu}+Be^{-pu}+D \] are studied. As by-product, we obt…

2016-10-11abs ↗pdf ↗

In this work we investigate approaches to reconstruct generator models from measurements available at the generator terminal bus using machine learning (ML) techniques. The goal is to develop an emulator which is trained online and is capable of fast predictive computations. The training is illustrated on synthetic dat…

2019-01-03abs ↗pdf ↗

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.

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…

2019-06-20abs ↗pdf ↗

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…

2017-03-17abs ↗pdf ↗

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.

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 increasing complexity of the power grid, due to higher penetration of distributed resources and the growing availability of interconnected, distributed metering devices re- quires novel tools for providing a unified and consistent view of the system. A computational framework for power systems data fusion, based on…

2017-05-24abs ↗pdf ↗

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.

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.

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…

2019-05-21abs ↗pdf ↗

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 …

2019-07-26abs ↗pdf ↗

We compute the rings H(N;F2)H^*(N;\mathbb{F}_2) for NN a closed Sol3\mathbb{S}ol^3-manifold and then determine the Borsuk-Ulam indices BU(N,φ)BU(N,φ) with φ0φ\not=0 in H1(N;F2)H^1(N;\mathbb{F}_2).

2013-01-06abs ↗pdf ↗

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.

This study develops methods to coordinate travel routes to reduce congestion.

problem Coordination of travel routes to reduce urban traffic congestion.
method Developed mathematical approaches to quantify coordination potential and adaptive centroid-based clustering algorithm (ACCA).
result ACCA efficiently forms proper coordination groups for CB-CRM, improving efficiency with minimal performance loss.

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.

New operations defined on moduli spaces for bundles with orientations.

problem Pushforward operations for principal bundles with orientations.
method Developed a general theory of pushforward operations for principal GG-bundles, constructing specific operations for G=BU(1)G=BU(1).
result Classified all stable pushforward operations and showed they are generated by the projective Euler and rank operations.

The paper provides gradient estimates for a specific equation on Riemannian manifolds.

problem Gradient estimates for positive solutions to a specific equation on Riemannian manifolds.
method Obtained gradient bounds for positive solutions without depending on the solution's bounds or the Laplacian of the distance function.
result Gradient bound of a positive solution does not depend on the solution's bounds or the Laplacian of the distance function.

A new method uses Gaussian Processes to solve power flow problems with uncertain renewable and load inputs.

problem Solving power flow problems with uncertain renewable and load inputs.
method Non-parametric Bayesian inference-based uncertainty propagation using Gaussian Processes.
result The method provides reasonably accurate solutions with fewer samples and time compared to Monte-Carlo simulations.

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.