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

25.0%50.0%75.0%100.0% · Dec 199219922001200920172026
48 results for fog computing

Bayesian method predicts runtime metrics for fog manufacturing.

problem Accurate prediction of runtime performance metrics in fog manufacturing.
method Bayesian sparse regression for multivariate mixed responses.
result Enhanced prediction and statistical inferences of runtime metrics.

Fog learning distributes ML model training across heterogeneous devices and networks.

problem Challenges with conventional federated learning in heterogeneous networks.
method Intelligent distribution of ML model training across nodes from edge devices to cloud servers.
result Enhanced federated learning with multi-layer hybrid framework considering network, heterogeneity, and proximity.

Machine Learning (ML) algorithms, like Convolutional Neural Networks (CNN), Support Vector Machines (SVM), etc. have become widespread and can achieve high statistical performance. However their accuracy decreases significantly in energy-constrained mobile and embedded systems space, where all computations need to be c…

2017-04-10abs ↗pdf ↗

Task offloading is a promising technology to exploit the benefits of fog computing. An effective task offloading strategy is needed to utilize the computational resources efficiently. In this paper, we endeavor to seek an online task offloading strategy to minimize the long-term latency. In particular, we formulate a s…

2018-04-20abs ↗pdf ↗

The method constructs arbitrage-free option surfaces from noisy quotes using Chebyshev bases and a fog post-fit layer.

problem Constructing arbitrage-free option price surfaces from noisy bid-ask quotes.
method Chebyshev tensor bases, linear sampling, no-arbitrage operators, quadratic objective, OSQP solvers, fog post-fit layer, Hamiltonian energy.
result High inside-spread coverage (98-99%) and low no-arbitrage violations (below 1%) in stable periods, controlled leakage in stressed periods.

Task offloading is an emerging technology in fog-enabled networks. It allows users to transmit tasks to neighbor fog nodes so as to utilize the computing resources of the networks. In this paper, we investigate a stochastic task offloading model and propose a multi-armed bandit framework to formulate this model. We con…

2018-06-27abs ↗pdf ↗

DefogGAN predicts hidden RTS game information to aid strategic decision-making.

problem Predicting hidden information in real-time strategy games like StarCraft.
method Conditional Generative Adversarial Network (GAN) with pyramidal reconstruction loss.
result DefogGAN predicts enemy buildings and combat units as accurately as professional players.

A hybrid neural network optimizes AI deployment on edge and cloud for energy efficiency.

problem Energy and resource constraints in edge devices for deep learning models.
method Conditionally deep hybrid neural network with quantized layers at edge and full-precision layers at cloud.
result Early classification at the edge reduces energy consumption by 5.5x on CIFAR-10 dataset.

Footfall based biometric system is perhaps the only person identification technique which does not hinder the natural movement of an individual. This is a clear edge over all other biometric systems which require a formidable amount of human intervention and encroach upon an individual's privacy to some extent or the o…

2018-09-24abs ↗pdf ↗

Small, carefully crafted perturbations called adversarial perturbations can easily fool neural networks. However, these perturbations are largely additive and not naturally found. We turn our attention to the field of Autonomous navigation wherein adverse weather conditions such as fog have a drastic effect on the pred…

2020-01-16abs ↗pdf ↗

With the advent of huges volumes of data produced in the form of fast streams, real-time machine learning has become a challenge of relevance emerging in a plethora of real-world applications. Processing such fast streams often demands high memory and processing resources. In addition, they can be affected by non-stati…

2020-02-06abs ↗pdf ↗

Recurrent Neural Networks (RNNs) have been shown to be valuable for constructing Intrusion Detection Systems (IDSs) for network data. They allow determining if a flow is malicious or not already before it is over, making it possible to take action immediately. However, considering the large number of packets that has t…

2020-02-10abs ↗pdf ↗

In this paper, we prove an extended version of the Minkowski Inequality, holding for any smooth bounded set ΩRnΩ\subset \mathbb R^n, n3n\geq 3. Our proof relies on the discovery of effective monotonicity formulas holding along the level set flow of the pp-capacitary potentials associated with ΩΩ, for every pp suffici…

2019-06-02abs ↗pdf ↗

Geometric quantization extended to arbitrary connected spaces using path integration.

problem Constructing a Prequantum Groupoid for arbitrary connected parasymplectic spaces.
method Define a Total Group of Periods and a Prequantum Groupoid with connected isotropy.
result The Prequantum Groupoid Tω\mathbf{T}_\omega is isomorphic to the group of symmetries of the Dynamical System.

New framework tackles deep financial reporting bottleneck by improving hallucination and coherence.

problem Statistical smoothing trap in LLMs limits deep financial reporting quality.
method DeepNews Framework integrates information foraging, schema-guided planning, and adversarial prompting.
result DeepNews system achieves 25% acceptance rate in blind test, significantly outperforming SOTA.

Optimizes QoS in FSO links over South Africa using ensemble learning.

problem Impact of weather on QoS in FSO links.
method Ensemble learning models (Random Forest, ADaBoost Regression, Stacking Regression, Gradient Boost Regression, Multilayer Neural Network) applied to meteorological data.
result Significant enhancement in QoS with RMSE and R-squared values of 0.0032 and 0.9906 respectively at George.

The paper introduces reservoir computing models for complex systems.

problem Modeling complex engineering systems using nonlinear autoregression.
method Introduces reservoir computing with output feedback as stationary and ergodic infinite-order nonlinear autoregressive models.
result Demonstrates versatility of classical and quantum reservoir computers in modeling synthetic and real data.

Defines computable learning for binary classification over metric spaces.

problem Defines computable PAC learning for binary classification over computable metric spaces.
method Provides sufficient conditions for ERM learners to be computable and bounds the strong Weihrauch degree of an ERM learner.
result Gives a hypothesis class that does not admit any proper computable PAC learner with computable sample function.

TKFT models computation via smooth vector fields, simulating functions in a single dynamical step.

problem Modeling computation in a single step.
method Established Topological Kleene Field Theory (TKFT) as a new model of computation.
result Any computable function can be simulated in a single go of a dynamical system.

Machine learning impacts computational math, offering new functions approximations.

problem Machine learning's black box nature hinders further progress in computational math.
method Analyzes machine learning's impact on computational math and vice versa.
result Integrating computational math with machine learning can enhance both fields.

Coded computation techniques provide robustness against straggling servers in distributed computing, with the following limitations: First, they increase decoding complexity. Second, they ignore computations carried out by straggling servers; and they are typically designed to recover the full gradient, and thus, canno…

2018-11-22abs ↗pdf ↗

This paper simplifies computing higher-order UU-statistics efficiently.

problem The inefficiency of computing higher-order UU-statistics in practice.
method Decomposition, connection to Einstein summation, and treewidth-based complexity estimate.
result A new, more efficient algorithm to compute UU-statistics.

Survey on computational models in dynamical systems, including new universality concepts.

problem Understanding the relationship between computational models and dynamical systems.
method Review of recent works on Turing universality, Topological Kleene Field Theories, and dynamical bordisms.
result Introduction of new perspectives on computability through dynamical systems.

Survey on quantum computing and neural networks.

problem Understanding and comparing quantum computing and neural networks.
method Introduction to quantum computing concepts, explanation of quantum computing paradigms, and analysis of quantum neural networks.
result Current state-of-the-art in quantum neural networks.

We present two paradigms relating algebraic, topological and quantum computational statistics for the topological model for quantum computation. In particular we suggest correspondences between the computational power of topological quantum computers, computational complexity of link invariants and images of braid grou…

2008-03-08abs ↗pdf ↗

As inductive inference and machine learning methods in computer science see continued success, researchers are aiming to describe ever more complex probabilistic models and inference algorithms. It is natural to ask whether there is a universal computational procedure for probabilistic inference. We investigate the com…

2010-05-17abs ↗pdf ↗

Quantum computing techniques improve graph analysis and community detection.

problem Analyzing large graphs efficiently and accurately.
method Used quantum annealing and quantum gate computers for community detection and regularity checking.
result Demonstrated the effectiveness of quantum computing in solving complex graph problems.

PALMS reconstructs large-scale networks efficiently with parallel computing.

problem Reconstructing large-scale latent networks from observed dynamics is computationally challenging.
method PALMS (Parallel Adaptive Lasso with Multi-directional Signals) framework for distributed network reconstruction.
result PALMS substantially reduces computational complexity and storage requirements.