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

1223 · Jul 201819922001200920172026
48 results for V1

V1 cortex reconstructs images as Poisson equation solutions with varying weights.

problem Reconstructing images from V1 cortical cell receptive profiles.
method Solves a heterogeneous Poisson equation with varying weights representing neural connectivity.
result Reconstructions converge to homogeneous solutions using homogenization techniques.

The ECME algorithm has proven to be an effective way of accelerating the EM algorithm for many problems. Recognising the limitation of using prefixed acceleration subspace in ECME, we propose the new Dynamic ECME (DECME) algorithm which allows the acceleration subspace to be chosen dynamically. Our investigation of an …

2010-04-04abs ↗pdf ↗

New method MRI improves machine learning models' ability to generalize to unseen data.

problem Machine learning models often fail to generalize well to out-of-distribution data.
method Introduces a new notion of invariance (MRI) and a practical version (MRI-v1) to improve model generalization.
result MRI-v1 guarantees invariant predictors and outperforms IRM-v1 in various settings.

MeliusNet improves binary neural networks to match MobileNet-v1 accuracy.

problem Achieving high accuracy with binary neural networks on mobile devices.
method Alternating DenseBlocks and ImprovementBlocks to increase feature capacity and quality.
result MeliusNet matches MobileNet-v1 accuracy on ImageNet, improving binary network performance.

In this study, we analyzed the activity of monkey V1 neurons responding to grating stimuli of different orientations using inference methods for a time-dependent Ising model. The method provides optimal estimation of time-dependent neural interactions with credible intervals according to the sequential Bayes estimation…

2018-07-24abs ↗pdf ↗

HIVE-COTE v1.0 improves time series classification with enhanced usability.

problem Improving time series classification accuracy and usability.
method Presented a walkthrough guide and extensive experimental evaluation of HIVE-COTE v1.0.
result HIVE-COTE v1.0 outperforms three recently proposed algorithms in predictive performance and resource usage.

PLS-Lasso integrates dimension reduction into regression for financial index tracking.

problem Dimension reduction and regression are traditionally treated separately in multivariate data analysis.
method PLS-Lasso integrates dimension reduction directly into the regression process, presenting two formulations: PLS-Lasso-v1 and PLS-Lasso-v2.
result PLS-Lasso-v1 and PLS-Lasso-v2 outperform Lasso in financial index tracking.

In math.DG/9903083 (henceforth referred to as EA) we defined an integer invariant h(Y)h(Y) for oriented integral homology 3-spheres YY which only depends on the rational homology cobordism class of YY and is additive under connected sums. In this paper we establish lower bounds for h(Y)h(Y) when YY is the boundary of a …

2001-11-04abs ↗pdf ↗

Let MM be a compact irreducible hyperkahler manifold, from Bogomolov inequality [V1] we obtain forbidden values of the second Betti number b2b_2 in arbitrary dimension. UPD: Unfortunately, decomposition of dual to BBF-form is not right in the main theorem. Instead of this work, take a look on recent preprints of Sawon…

2014-01-02abs ↗pdf ↗

New model for visual cortex border completion using bicycle wheel motions.

problem Understanding border completion in the visual cortex V1.
method Sub-Riemannian Hamiltonian formalism and bicycle wheel analogy.
result Analogies between visual cortex border completion and bicycle wheel motions.

Adversarial Robustness Toolbox (ART) is a Python library supporting developers and researchers in defending Machine Learning models (Deep Neural Networks, Gradient Boosted Decision Trees, Support Vector Machines, Random Forests, Logistic Regression, Gaussian Processes, Decision Trees, Scikit-learn Pipelines, etc.) agai…

2018-07-03abs ↗pdf ↗

E2GC optimizes energy efficiency in DNNs by balancing computational and data movement costs.

problem Imbalance between computational complexity and data reuse in GConv leads to suboptimal energy efficiency.
method Developed an optimum group size model and proposed E2GC module with constant group size.
result E2GC modules improve energy efficiency by 10.8% and 4.73% on P100 and P4000 GPUs, respectively.

Adds a precortical module to CNNs for improved robustness to light variations.

problem Robustness of CNNs to global light intensity and contrast variations.
method Developed a mathematical model of the mammalian visual pathway, inspired by CNNs, and added a preliminary convolutional module.
result Significantly more robust CNNs achieved with added module on MNIST, FashionMNIST, and SVHN databases.

This study reviews decentralized prediction markets, identifying key design variants and open problems.

problem Designing and implementing decentralized prediction markets with desirable properties.
method Modular workflow comprising eight stages: infrastructure, market topic, share structure, pricing, market initialization, trading, resolution, settlement, and archiving. Analysis of design variants and trade-offs.
result Identification of open problems for researchers in the field of decentralized prediction markets.

Capsule Networks (CN) offer new architectures for Deep Learning (DL) community. Though its effectiveness has been demonstrated in MNIST and smallNORB datasets, the networks still face challenges in other datasets for images with distinct contexts. In this research, we improve the design of CN (Vector version) namely we…

2019-03-18abs ↗pdf ↗

The notion of utility maximising entropy (u-entropy) of a probability density, which was introduced and studied by Slomczynski and Zastawniak (Ann. Prob 32 (2004) 2261-2285, arXiv:math.PR/0410115 v1), is extended in two directions. First, the relative u-entropy of two probability measures in arbitrary probability space…

2007-09-09abs ↗pdf ↗

The problem of video frame prediction has received much interest due to its relevance to many computer vision applications such as autonomous vehicles or robotics. Supervised methods for video frame prediction rely on labeled data, which may not always be available. In this paper, we provide a novel unsupervised deep-l…

2019-08-28abs ↗pdf ↗

Model explains optical illusions using geometric sub-Riemannian geodesics.

problem Understanding and explaining geometrical optical illusions.
method Neuro-mathematical model based on sub-Riemannian geodesics in the Roto-Translation Group.
result Illusory contours are described as geodesics in a new metric.

Campfire simplifies sparse training for CNNs, achieving high accuracy with minimal pruning.

problem Training CNNs with sparse weights to maintain high accuracy and robustness.
method Gradual pruning technique with simplified sparsity structure, exploring various tradeoffs.
result Sparse ResNet-50 and ResNet-50 v1.5 achieve 75% top-1 accuracy with 70% sparsity, <1% accuracy loss.

Deep learning models (aka Deep Neural Networks) have revolutionized many fields including computer vision, natural language processing, speech recognition, and is being increasingly used in clinical healthcare applications. However, few works exist which have benchmarked the performance of the deep learning models with…

2017-10-23abs ↗pdf ↗

We propose a novel method to embed a functional magnetic resonance imaging (fMRI) dataset in a low-dimensional space. The embedding optimally preserves the local functional coupling between fMRI time series and provides a low-dimensional coordinate system for detecting activated voxels. To compute the embedding, we bui…

2007-09-19abs ↗pdf ↗

Framework mitigates overfitting in quantitative trading strategies.

problem Overfitting during strategy transition from backtest to live trading.
method Three-stage protocol: IS, WFA, OOS; majority pass, purge gaps, cliff veto, etc.
result Demonstrates how to detect overfitting through performance decay and drawdown behavior.

DataInf efficiently approximates data influence in large models, improving transparency and identifying mislabeled data.

problem Efficiently estimating data influence in large-scale models like LoRA-tuned LLMs and diffusion models.
method DataInf uses a closed-form expression to approximate influence scores efficiently.
result DataInf outperforms existing methods in computational and memory efficiency, accurately identifying influential data points.

We introduce a model of the set of all Polish (=separable complete metric) spaces: the cone R\cal R of distance matrices, and consider geometric and probabilistic problems connected with this object. The notion of the universal distance matrix is defined and we proved that the set of such matrices is everywhere dense …

2002-05-08abs ↗pdf ↗

Generative models create indistinguishable adversarial objects for object detection.

problem Creating unrestricted adversarial examples for object detection.
method Search over latent space of GAN for adversarial objects.
result Generated adversarial objects are indistinguishable from non-adversarial objects and transferable.