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

Trend · papers per month

69139208277 · Jun 202019922001200920172026
48 results for multi-level architecture

Object-based approaches for learning action-conditioned dynamics has demonstrated promise for generalization and interpretability. However, existing approaches suffer from structural limitations and optimization difficulties for common environments with multiple dynamic objects. In this paper, we present a novel self-s…

2019-04-16abs ↗pdf ↗

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.

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.

3D object recognition accuracy can be improved by learning the multi-scale spatial features from 3D spatial geometric representations of objects such as point clouds, 3D models, surfaces, and RGB-D data. Current deep learning approaches learn such features either using structured data representations (voxel grids and o…

2018-05-30abs ↗pdf ↗

HM-NAS improves neural architecture search by learning optimal architectures.

problem Limited flexibility in architecture candidates due to hand-designed heuristics.
method Incorporates multi-level encoding and hierarchical masking to automatically learn optimal architectures.
result Achieves better architecture search performance and competitive model accuracy.

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.

Paper develops neural network for Mandarin polyphone disambiguation.

problem Homograph problem in Mandarin Chinese text-to-speech.
method Bidirectional RNN for context, prediction network for mapping embeddings to pronunciations.
result Achieves 94.69% accuracy on polyphonic character dataset.

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.

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.

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.

Proposes MLCNN for better multivariate time series forecasting.

problem Challenges in forecasting multivariate time series, especially the limitation of predicting only one future moment.
method MLCNN, a multi-task deep learning framework inspired by Construal Level Theory, fuses future visions of near and distant future predictions.
result Significant improvements in forecasting accuracy (4.59% RMSE reduction, 6.87% MAE reduction) on real-world datasets.

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.

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.

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.

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.

Improved 3D generative models for drug design reduce bias and enhance data efficiency.

problem Data sparsity and bias in 3D molecular design models.
method Multi-level contrastive learning protocol for bias control and data efficiency.
result Hierarchical generative models that are topologically unbiased and explainable.

JIMA uses multi-level preference data to recommend composite items.

problem Recommending composite items efficiently with multi-level preference information.
method Joint Interaction Modeling (JIMA) approach that integrates multi-level preference data and interactions.
result JIMA outperforms advanced baselines in offline and online settings.

Simulation study evaluates tree-based imputation methods for multi-level data.

problem Ignoring dependencies in hierarchical data can compromise imputation accuracy.
method Chained Random Forests and Extreme Gradient Boosting (mixgb) adapted for multi-level data.
result Adapted boosting methods outperform traditional MICE for Level-1 variables at higher missingness rates.

New algorithm solves complex optimization problems without needing projections.

problem Optimizing nested functions under convex constraints with noisy evaluations.
method Projection-free conditional gradient-type algorithm for smooth stochastic multi-level composition optimization.
result The algorithm achieves εε-stationary solutions with complexity bounds independent of εε and TT.

Proposes MGPLL for PL learning with non-random noise.

problem Partial label learning with non-random label noise.
method Bi-directional mapping framework, conditional noise label generation, multi-class predictor, adversarial learning.
result Demonstrates state-of-the-art performance in partial label learning.

Many prediction problems can be phrased as inferences over local neighborhoods of graphs. The graph represents the interaction between entities, and the neighborhood of each entity contains information that allows the inferences or predictions. We present an approach for applying machine learning directly to such graph…

2016-11-21abs ↗pdf ↗

GraphZoom improves graph embedding accuracy and scalability.

problem Node attribute noise and scalability issues in graph embedding models.
method GraphZoom combines graph fusion and multi-level coarsening to improve accuracy and scalability.
result GraphZoom significantly increases classification accuracy and speeds up the embedding process.

Study shows how order flow at multiple price levels affects stock prices.

problem Understanding how order flow at different price levels influences stock prices.
method Fit a linear relationship between multi-level order-flow imbalance (MLOFI) and mid-price changes using high-quality data.
result The inclusion of more price levels in MLOFI improves the fit with mid-price changes.

This paper tackles URLLC in 6G networks with deep learning.

problem Stringent requirements on end-to-end delay and reliability for mission-critical applications.
method Develops a multi-level architecture combining theoretical models and real-world data, using deep transfer learning and federated learning.
result Demonstrates improved performance in URLLC for mission-critical applications.

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.

Study develops advanced models to forecast complex LOB data.

problem Forecasting high-frequency data in a limit order book (LOB).
method Advanced multidimensional sequence-to-sequence models with compound multivariate embedding.
result Method outperforms other multivariate forecasting methods, achieving lowest forecasting error.