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

Trend · papers per month

3571106141 · Jun 202019922001200920172026
48 results for Kernel Packets

Exact and scalable algorithm for Gaussian process regression with Matérn correlations.

problem Efficient Gaussian process regression with Matérn correlations.
method Novel kernel packet theory and sparse representation of covariance matrix.
result Significantly superior to existing alternatives in computational time and predictive accuracy.

A new framework using kernel packets overcomes limitations of state space models for multi-dimensional data.

problem Computational limitations of Gaussian process regression in large-scale applications.
method Kernel packet approach, identifying KPs via forward and backward state space representations.
result Exact, memory-efficient inference with linear-time training and logarithmic/predictive time.

Kernel Multigrid accelerates Back-fitting for additive Gaussian Processes.

problem Slow convergence of Back-fitting in training additive Gaussian Processes.
method Kernel Packets (KP) and Sparse Gaussian Process Regression (GPR) to enhance Back-fitting.
result Kernel Multigrid reduces the required iterations to O(logn)\mathcal{O}(\log n).

In order to improve mobile data transparency, a number of network-based approaches have been proposed to inspect packets generated by mobile devices and detect personally identifiable information (PII), ad requests, or other activities. State-of-the-art approaches train classifiers based on features extracted from HTTP…

2019-07-30abs ↗pdf ↗

Decentralized learning ensures stability in online queuing systems with packet rates above 1.

problem Ensuring stability in online queuing systems with decentralized learning.
method Proposed cooperative queues and a learning algorithm for packet rates above 1.
result Decentralized learning strategies guarantee stability in queuing systems with packet rates above 1.

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 ↗

A deep learning framework learns wavelet packet transforms for efficient feature extraction.

problem Efficiently extracting meaningful time-frequency features from high-frequency signals.
method Learnable wavelet packet transforms using deep learning.
result Improved spectral leakage and enhanced anomaly detection performance.

The paper develops algorithms to minimize queue length regret in a communication system.

problem Minimizing the difference between actual and optimal queue lengths over time slots.
method Introduces queue length regret and applies algorithms from stochastic multi-armed bandit problem to analyze system performance.
result Order optimal O(1)O(1) queue length regret can be achieved with queue-length based policies.

Paper uses RL to optimize SFC deployment and VNF management in NFV networks.

problem Optimizing SFC deployment and VNF management in NFV networks to reduce packet loss.
method Reinforcement Learning (PPO) to optimize SFC deployment and VNF management.
result PPO agent reduces packet loss in SFC deployment and VNF management.

A decentralized routing framework for lunar exploration robots.

problem Routing data in intermittent connectivity lunar networks.
method Graph Attention-based Multi-Agent Reinforcement Learning (GAT-MARL).
result Higher delivery rates, no duplications, fewer packet losses.

Recurrent Neural Networks (RNNs) yield attractive properties for constructing Intrusion Detection Systems (IDSs) for network data. With the rise of ubiquitous Machine Learning (ML) systems, malicious actors have been catching up quickly to find new ways to exploit ML vulnerabilities for profit. Recently developed adver…

2019-12-20abs ↗pdf ↗

Intrusion Detection System (IDS) is one of the most effective solutions for providing primary security services. IDSs are generally working based on attack signatures or by detecting anomalies. In this paper, we have presented AutoIDS, a novel yet efficient solution for IDS, based on a semi-supervised machine learning …

2019-11-08abs ↗pdf ↗

Shelstad's character identity is an equality between sums of characters of tempered representations in corresponding LL-packets of two real, semisimple, linear, algebraic groups that are inner forms to each other. We reconstruct this character identity in the case of the discrete series, using index theory of elliptic…

2017-11-03abs ↗pdf ↗

We consider the motion of small bodies in general relativity. The key result captures a sense in which such bodies follow timelike geodesics (or, in the case of charged bodies, Lorentz-force curves). This result clarifies the relationship between approaches that model such bodies as distributions supported on a curve, …

2017-07-13abs ↗pdf ↗

The correspondence between Riemann-Finsler geometries and effective field theories with spin-independent Lorentz violation is explored. We obtain the general quadratic action for effective scalar field theories in any spacetime dimension with Lorentz-violating operators of arbitrary mass dimension. Classical relativist…

2018-09-14abs ↗pdf ↗

We develop a definitive physical-space scattering theory for the scalar wave equation on Kerr exterior backgrounds in the general subextremal case |a|<M. In particular, we prove results corresponding to "existence and uniqueness of scattering states" and "asymptotic completeness" and we show moreover that the resulting…

2014-12-29abs ↗pdf ↗

New algorithm reduces age of information in wireless networks with unknown channel reliability.

problem Learning optimal source-channel pairs to minimize age of information in wireless networks.
method Introduces AoI regret, novel learning algorithm with bounded AoI regret.
result Developed a learning algorithm with O(1)O(1) AoI regret, improving upon Θ(logT)Θ(\log T).

Global existence and boundedness proved for quasilinear wave equations on Kerr black holes.

problem Global existence and boundedness for quasilinear wave equations on Kerr black holes.
method Combines linear inhomogeneous estimates on Kerr backgrounds and tailored physical space currents.
result Global existence, boundedness and decay for small data solutions to quasilinear wave equations on Kerr black holes.

Starfield optimizes satellite links for LEO mega-constellations by aligning ISLs with regional traffic patterns.

problem Forming a stable satellite topology in LEO mega-constellations with limited ISLs and unstable acquisition.
method Starfield uses a demand-aware heuristic algorithm based on traffic flows and Riemannian geometry to assign satellite links.
result Starfield reduces hop count and improves stretch factor by up to 30% compared to existing methods.

The rapid digital transformation without security considerations has resulted in the rise of global-scale cyberattacks. The first line of defense against these attacks are Network Intrusion Detection Systems (NIDS). Once deployed, however, these systems work as blackboxes with a high rate of false positives with no mea…

2019-08-26abs ↗pdf ↗

Growing number of network devices and services have led to increasing demand for protective measures as hackers launch attacks to paralyze or steal information from victim systems. Intrusion Detection System (IDS) is one of the essential elements of network perimeter security which detects the attacks by inspecting net…

2019-11-26abs ↗pdf ↗

Introduces CSLC models to bridge deep generative models and classical algorithms.

problem Mode collapse and memorization issues in deep generative models and restrictive assumptions in classical algorithms.
method Introduces conditionally strongly log-concave (CSLC) models, factorizing data distribution into strongly log-concave conditional distributions.
result Efficient parameter estimation and sampling algorithms with theoretical guarantees for non-log-concave data distributions.

The paper addresses instability in CNNs' first layer by proving max pooling's shift invariance.

problem Instability in CNNs' first layer, leading to sensitivity to small input shifts.
method Establishing conditions for max pooling's shift invariance and deriving a measure of stability.
result Max pooling approximates a nearly shift-invariant complex modulus under certain conditions.

Let GG be a semisimple Lie group with discrete series. We use maps K0(CrG)CK_0(C^*_rG)\to \mathbb{C} defined by orbital integrals to recover group theoretic information about GG, including information contained in KK-theory classes not associated to the discrete series. An important tool is a fixed point formula for equiv…

2018-03-20abs ↗pdf ↗

A complex-valued convolutional network (convnet) implements the repeated application of the following composition of three operations, recursively applying the composition to an input vector of nonnegative real numbers: (1) convolution with complex-valued vectors followed by (2) taking the absolute value of every entry…

2015-03-11abs ↗pdf ↗

Paper addresses state estimation in sensor networks with intermittent data.

problem State estimation in sensor networks with packet dropouts and corrupted observations.
method Bayesian variational inference with a dual-mask generative model.
result The method effectively identifies system states and noise parameters.

Cybersecurity attacks are growing both in frequency and sophistication over the years. This increasing sophistication and complexity call for more advancement and continuous innovation in defensive strategies. Traditional methods of intrusion detection and deep packet inspection, while still largely used and recommende…

2020-01-17abs ↗pdf ↗