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.

169,051 papers · 148 categories

Trend · papers per month

0.6%1.2%1.8%2.4% · May 202619922001200920182026
48 results for multi-level voxel grid

Tab2vox converts tabular data into 3D images for improved demand forecasting.

problem Forecasting demand influenced by multi-level causes and large volatility.
method Tab2vox neural architecture search (NAS) model to convert tabular data into 3D voxel images for 3D CNN forecasting.
result 3D CNN forecasting model outperforms existing tabular data techniques.

Paper proposes PRR network for better experience reuse in reinforcement learning.

problem Efficient experience reuse in reinforcement learning across multiple granularities.
method Proposes PRR network trained on multi-level architecture to extract and store experience.
result PRR network leads to better experience reuse and improved performance.

Paper presents voxel graph operators for vector data models.

problem Efficient conversion and analysis of geometric models.
method Topological voxelization, graph construction, differential operator derivation.
result Discrete differential and integral operators from voxel complexes.

Deep learning estimates dose voxel kernels from CT data for personalized dosimetry.

problem Accurate estimation of absorbed dose in personalized radionuclide therapy.
method Combining deep learning with CT data to approximate dose voxel kernels from density kernels.
result Deep learning achieved an intersection-over-union score of 0.86 and mean squared error of 1.24×10−4 on real patient data.

DeepFDR uses deep learning for better FDR control in neuroimaging data.

problem Spatial dependence among voxel-based tests in neuroimaging data.
method DeepFDR leverages unsupervised deep learning-based image segmentation.
result DeepFDR outperforms existing methods in FDR control and computational efficiency.

New algorithm trains binary-activation, multi-level RNNs for noise-resilient, ADC-/DAC-free PIM inference.

problem Training noise-resilient, ADC-/DAC-free neural networks.
method Binary activations and multi-level weights for eNVM-based processing-in-memory circuits.
result Higher accuracy and noise resilience for recurrent networks compared to existing methods.

3D neural network models atomistic potentials in complex alloys.

problem Designing robust atomistic potentials for complex alloys is computationally expensive and time-consuming.
method Voxelized atomic configurations and 3D convolutional neural networks to learn atomic interactions.
result 3D convolutional neural networks effectively model atomistic potentials in complex alloys.

The paper presents a new set of axioms of digital topology, which are easily understandable for application developers. They define a class of locally finite (LF) topological spaces. An important property of LF spaces satisfying the axioms is that the neighborhood relation is antisymmetric and transitive. Therefore any…

2010-10-04abs ↗pdf ↗

Proposes a multi-resolution model for prostate cancer classification using mpMRI.

problem Improving voxel-wise classification of prostate cancer using multi-parametric MRI data.
method Multi-resolution Super Learner framework combining local base learners at multiple resolutions and spatial Gaussian kernel smoothing.
result Enhanced voxel-wise classification of prostate cancer status and clinical significance.

The paper tackles multi-level fairness in algorithmic systems, addressing bias at both individual and structural levels.

problem Algorithmic systems can unfairly impact marginalized groups, especially when considering only individual-level bias.
method Formalizes multi-level fairness using causal inference tools, addressing effects of sensitive attributes at multiple levels.
result Illustrates the importance of accounting for macro-level sensitive attributes in fairness assessments.

DET unifies geometric and functional alignment for high-dimensional scientific data.

problem Challenges in nonrigid registration for high-dimensional, irregular data.
method Domain Elastic Transform (DET) treats data as functions on irregular domains, using a Bayesian framework for elastic motion registration.
result DET achieves 92% topological preservation on MERFISH data and successfully registers whole-embryo Stereo-seq atlases.

Study active learning for multi-level user preferences in recommendation systems.

problem Efficiently learning user preferences through active querying in recommendation systems.
method Proposes a theoretically optimal active learning strategy based on Fisher information matrix for collective matrix factorization.
result Demonstrates strong improvements over active learning methods in personalized, cold-start, and noisy data settings.

fMRI analysis classifies autobiographical memory valence across individuals.

problem Classifying valence of autobiographical memories across different participants.
method Feature selection (ReliefF) combined with boosting methods applied to voxel space data.
result Classification accuracy of 62% in cross-participant setting, significantly higher than previous results.

This paper proposes a method to improve few-shot learning by generating multi-level weight-centric features.

problem Improving few-shot learning performance by leveraging both representation power and weight generation capacity.
method A multi-level weight-centric feature learning approach with a weight-centric training strategy and multi-level feature incorporation.
result Significantly outperforms existing methods in low-shot classification benchmarks.

A relatively recent advance in cognitive neuroscience has been multi-voxel pattern analysis (MVPA), which enables researchers to decode brain states and/or the type of information represented in the brain during a cognitive operation. MVPA methods utilize machine learning algorithms to distinguish among types of inform…

2012-05-10abs ↗pdf ↗

We introduce in this paper a new way of optimizing the natural extension of the quantization error using in k-means clustering to dissimilarity data. The proposed method is based on hierarchical clustering analysis combined with multi-level heuristic refinement. The method is computationally efficient and achieves bett…

2012-04-29abs ↗pdf ↗

New algorithms solve complex multi-level optimization problems with improved efficiency.

problem Smooth stochastic multi-level composition optimization problems.
method Two algorithms using moving-average and linearized stochastic estimates.
result Achieved sample complexities of O(1/ε^4) and O(1/ε^6).

PFPN improves salient object detection by progressively polishing multi-level features.

problem Improving salient object detection by refining multi-level features.
method Progressive Feature Polishing Network (PFPN) with Feature Polishing Modules (FPMs).
result PFPN achieves superior performance on five benchmark datasets without post-processing.

A distributed SGD method for heterogeneous networks with hubs and workers.

problem Learning in heterogeneous multi-level networks with worker heterogeneity and varying communication.
method Multi-Level Local SGD: distributed SGD with hub-and-spoke paradigm and hub averaging.
result The method converges with error dependent on worker heterogeneity, hub network topology, and iterations.

A new method for solving complex sequential decision-making problems by decomposing them into multiple levels.

problem Sequential decision-making with natural multi-level structure.
method Multi-level meta-reinforcement learning with skill-based curriculum.
result Efficiently reduces stochasticity and policy search space, leading to fewer iterations and computations.

Jointly models cause-of-death mortality rates across multiple countries and genders.

problem Modeling cause-of-death mortality rates in a multinational setting.
method Multi-Output Gaussian Processes (MOGP) with Kronecker-structured kernels and latent factors.
result Efficiently captures heterogeneity and dependence across different factor inputs.

Paper proposes a deep subspace clustering method using multi-level representations.

problem Deep subspace clustering of images.
method Convolutional autoencoders with multiple fully-connected layers for multi-level representations, loss minimization with iterative updates.
result The method outperforms state-of-the-art methods on real-world datasets.

Diffusion MRI (dMRI) provides the ability to reconstruct neuronal fibers in the brain, in vivo\textit{in vivo}, by measuring water diffusion along angular gradient directions in q-space. High angular resolution diffusion imaging (HARDI) can produce better estimates of fiber orientation than the popularly used diffusion tens…

2016-12-18abs ↗pdf ↗

This paper tackles tensor recovery from noisy and multi-level quantized measurements.

problem Tensors from multi-level quantized measurements.
method Nonconvex optimization problem with alternating proximal gradient descent.
result The recovery error diminishes to zero with increasing tensor dimensions.

3D Convolutional Neural Networks are sensitive to transformations applied to their input. This is a problem because a voxelized version of a 3D object, and its rotated clone, will look unrelated to each other after passing through to the last layer of a network. Instead, an idealized model would preserve a meaningful r…

2018-04-12abs ↗pdf ↗

New method for optimizing complex composite functions with reduced variance.

problem Optimizing multi-level composite functions with nested random and smooth mappings.
method Normalized proximal approximate gradient (NPAG) method with nested stochastic variance reduction.
result Total sample complexity of O(ε3)O(ε^{-3}) in expectation and O(N+Nε2)O(N+\sqrt{N}ε^{-2}) in finite-sum cases.

New MRI method maps tissue parameters more accurately by ignoring voxel independence.

problem Voxel independence assumption limits model fitting reliability and repeatability.
method Self-supervised deep variational approach with Gaussian mixture prior.
result Our method outperforms current techniques in dMRI simulations and real data.

MAOP learns object dynamics from raw visual data.

problem Efficient learning of dynamics from raw visual data for multiple objects.
method Three-level learning architecture with spatial-temporal relational reasoning.
result Significantly outperforms previous methods in sample efficiency and generalization.

MRI method predicts glioma features, survival, and endothelial proliferation.

problem Invasive biopsy limits detection of glioma features due to tumor heterogeneity.
method Voxel-wise, multiparametric MRI radiomics with k-NN classifier.
result Model accurately predicts disease compositions, survival, and endothelial proliferation.

Optimal gradient quantization reduces communication costs in distributed deep learning.

problem High communication costs in distributed training of deep neural networks.
method Deduced optimal gradient quantization conditions for binary and multi-level quantization, developed novel schemes for dynamic quantization levels.
result Demonstrated superior performance of proposed quantization schemes on CIFAR and ImageNet datasets.

In this article we propose a novel approach to reduce the computational complexity of various approximation methods for pricing discrete time American options. Given a sequence of continuation values estimates corresponding to different levels of spatial approximation and time discretization, we propose a multi-level l…

2013-03-06abs ↗pdf ↗

Enhances social spam detection using multi-level dependency of relational sequences.

problem Social spam detection in multi-relation social networks.
method Developed the Multi-level Dependency Model (MDM) to exploit long-term and short-term dependencies in user relational sequences.
result MDM improves social spam detection accuracy on a real-world multi-relational social network.

Partial soft-matching distance improves neural representation comparison by allowing some neurons to remain unmatched.

problem Neural representations are noisy and contain outliers, making traditional matching methods unreliable.
method Extends soft-matching distance to a partial optimal transport setting, allowing some neurons to remain unmatched.
result Partial soft-matching provides robust correspondences that are more reliable under noise and outliers.

COLUMBUS discovers new features to improve domain generalization.

problem Improving machine learning models' ability to generalize to unseen domains.
method COLUMBUS uses targeted corruption of input and multi-level representations to discover new features.
result COLUMBUS achieves state-of-the-art performance on DG benchmarks.

Develops a method to ensure accurate quantile forecasts across multiple levels.

problem Ensuring accurate quantile forecasts at multiple levels, even under distribution shifts.
method Multi-level quantile tracker (MultiQT) wraps around any forecaster to produce calibrated forecasts.
result Guaranteed calibration of quantile forecasts at multiple levels, even against adversarial shifts.