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

0.3%0.5%0.8%0.4% · Dec 201019922001200920172026
47 results for Linux OS

Paper proposes anomaly detection using Eigentraces and one-class classification.

problem Detect anomalies in system call trace data for Linux OS.
method One-class classification with Eigentraces feature extraction, Radial Basis Function neural network, and Random Forest.
result High performance in detecting anomalies and normal activities.

The paper benchmarks OS with RCTs, accounting for right-censoring.

problem Benchmarking observational studies with experimental data under censoring.
method Two cases: independent and dependent censoring. Censoring-doubly-robust signal for CATE.
result Effectiveness of censoring-aware tests verified via experiments and real data.

A simple block configures optimal kernel sizes for time series classification.

problem Choosing the right kernel size for time series classification.
method Proposes Omni-Scale block (OS-block) with kernel sizes determined by prime numbers.
result Models with OS-block achieve state-of-the-art performance on time series benchmarks.

A novel approach uses an ensemble of Gaussian processes for robust and adaptive reinforcement learning.

problem Adaptive reinforcement learning in large or continuous state spaces.
method Online scalable (OS) approach with a weighted ensemble of Gaussian processes.
result The ensemble approach improves performance in adversarial settings.

Sparse OSEs achieve optimal embedding dimension of O(d).

problem Achieving optimal embedding dimension for sparse OSEs.
method Random sparsified matrix with m(1+θ)dm \geq (1+θ)d non-zeros per column.
result Sparse OSEs can achieve embedding dimension m=O(d)m=O(d), improving on previous m=O(dlog(d))m=O(d\log(d)).

New methods improve causal inference generalization using trial and observational data.

problem Limited trial data makes generalizing causal inferences to target populations statistically infeasible.
method Develops algorithms that combine trial and observational data to estimate complex nuisance functions.
result Improves generalization of causal inferences when the additional observational study is high-quality.

Suppose that X,XX,X' are simply-connected closed exotic 4-manifolds. It is well-known that XX' is obtained by an order 2 cork twist of XX. We give an infinite exotic family of 4-manifolds not generated by any infinite order cork. This is the first example admitting such a condition. We prove a necessary condition of 4…

2016-09-14abs ↗pdf ↗

The problem of high-dimensional path-dependent optimal stopping (OS) is important to multiple academic communities and applications. Modern OS tasks often have a large number of decision epochs, and complicated non-Markovian dynamics, making them especially challenging. Standard approaches, often relying on ADP, dualit…

2018-07-06abs ↗pdf ↗

A new method improves density ratio estimation efficiency and accuracy.

problem Density ratio estimation trade-off between quality and efficiency.
method One-step Score-based Density Ratio Estimation (OS-DRE) combining analytic and solver-free approach.
result OS-DRE offers a favorable balance between estimation quality and inference efficiency.

In the framework of the theory of differential coverings \cite{KV}, we discuss a general geometric construction that serves the base for the so-called Lax pairs containing differentiation with respect to the spectral parameter \cite{OS}. Such kind of objects arise, for example, when studying integrability properties of…

2014-01-03abs ↗pdf ↗

Proposes new stochastic algorithms for multi-objective optimization.

problem Multi-objective optimization in machine learning problems.
method Direction-oriented multi-objective formulation and Stochastic Direction-oriented Multi-objective Gradient descent (SDMGrad).
result Stochastic algorithms converge to Pareto stationary points with improved complexities.

Gaussian processes (GP) are powerful tools for probabilistic modeling purposes. They can be used to define prior distributions over latent functions in hierarchical Bayesian models. The prior over functions is defined implicitly by the mean and covariance function, which determine the smoothness and variability of the …

2012-06-25abs ↗pdf ↗

In this note, we use a result of Osserman and Schiffer \cite{OS} to give a variational characterization of the catenoid. Namely, we show that subsets of the catenoid minimize area within a geometrically natural class of minimal annuli. To the best of our knowledge, this fact has gone unremarked upon in the literature. …

2010-12-17abs ↗pdf ↗

The first part of this article is a general introduction to the the theory of representation spaces of discrete groups into SL(n,C). Special attention is paid to knot groups. In Section 2 we discuss the difference between the tangent space at the representation variety, and the representation scheme. We give an example…

2016-02-11abs ↗pdf ↗

Background and Purpose: Biopsy is the main determinants of glioma clinical management, but require invasive sampling that fail to detect relevant features because of tumor heterogeneity. The purpose of this study was to evaluate the accuracy of a voxel-wise, multiparametric MRI radiomic method to predict features and d…

2019-08-06abs ↗pdf ↗

InfoTree improves reinforcement learning by optimizing tool use with a greedy submodular approach.

problem Maximizing information from tool use in reinforcement learning with limited resources.
method Formalizes Rollout Informativeness, recasts state selection as submodular maximization, and uses UUCB and ABA.
result InfoTree outperforms existing methods across various benchmarks, improving performance by 18.2% on average.

The study models market price movement based on investors' expectations.

problem Understanding the dynamics of investors' expectations and market price movement.
method Developed a non-linear evolutionary equation linking investors' expectations and market asset price movement.
result Model predictions co-integrated with asset time series, suggesting potential for price movement forecasting.

A major challenge in computed tomography (CT) is to reduce X-ray dose to a low or even ultra-low level while maintaining the high quality of reconstructed images. We propose a new method for CT reconstruction that combines penalized weighted-least squares reconstruction (PWLS) with regularization based on a sparsifying…

2017-07-10abs ↗pdf ↗

Statistical image reconstruction (SIR) methods are studied extensively for X-ray computed tomography (CT) due to the potential of acquiring CT scans with reduced X-ray dose while maintaining image quality. However, the longer reconstruction time of SIR methods hinders their use in X-ray CT in practice. To accelerate st…

2015-12-14abs ↗pdf ↗

Parametric images provide insight into the spatial distribution of physiological parameters, but they are often extremely noisy, due to low SNR of tomographic data. Direct estimation from projections allows accurate noise modeling, improving the results of post-reconstruction fitting. We propose a method, which we name…

2018-03-27abs ↗pdf ↗

As the number of contributors to online peer-production systems grows, it becomes increasingly important to predict whether the edits that users make will eventually be beneficial to the project. Existing solutions either rely on a user reputation system or consist of a highly specialized predictor that is tailored to …

2018-01-12abs ↗pdf ↗

Existing malware detectors on safety-critical devices have difficulties in runtime detection due to the performance overhead. In this paper, we introduce PROPEDEUTICA, a framework for efficient and effective real-time malware detection, leveraging the best of conventional machine learning (ML) and deep learning (DL) te…

2017-12-04abs ↗pdf ↗

FLeet improves online FL for mobile apps with better performance and privacy.

problem Federated Learning's offline nature limits its applicability for online updates.
method Combines staleness awareness and performance prediction with adaptive learning.
result 2.3x quality boost with minimal battery consumption.

Study develops curvature for contact-sequence networks, revealing temporal dynamics.

problem Lack of geometric analysis for temporal network sequences.
method Develops Forman--Ricci curvature on spatiotemporal prism complexes.
result Two curvature variants disagree on 56-67% of temporal edges.

New method estimates optimal personalized treatment rules from mixed data sources.

problem Combining RCT and observational data for personalized treatment rules.
method Doubly robust estimator for value function, maximizing within pre-specified ITR class.
result Consistent and asymptotically normal optimal value estimator with N1/3N^{-1/3} rate of convergence.

On-device federated learning updates edge models by exchanging trained results.

problem Limited training data at edge devices due to model drift.
method OS-ELM for sequential training and autoencoder for anomaly detection, combined with federated learning.
result The proposed approach produces a merged model as accurately as traditional methods with lower costs.