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

96193289385 · Jun 202019922001200920172026
48 results for Compact Design

Automates graph convolutional network design for semi-supervised node classification.

problem Designing optimal graph convolutional network architectures for semi-supervised node classification.
method An automatic process to define a problem-specific architecture based on graph structure.
result The proposed method outperforms existing methods in classification performance and network compactness.

A new method achieves optimal uniformity in designs with minimal flexibility.

problem Achieving optimal uniformity in designs with minimal flexibility.
method Derive a lower bound on the uniformity constant and use a greedy construction to achieve this bound, then extend the scheme for more flexibility.
result A simple greedy construction achieves the optimal uniformity constant.

Proposes methods for local clustering in attributed graphs.

problem Finding a single cluster concentrated on a specific region in a graph.
method Introduces Graph Unimodality (GU) and Attribute Unimodality (AU) measures, and LOCLU algorithm to optimize Compactness score.
result Local cluster detected by LOCLU concentrates on the region of interest and exhibits unimodal data distribution.

ConfHit provides valid guarantees for generative models without oracle access.

problem Reliable guarantees for novel candidate generation in generative models.
method Formalizes certification and refinement of generated sets, leveraging weighted exchangeability and density-ratio weighted conformal p-values.
result Consistently delivers valid coverage guarantees and compact certified sets across various generative tasks.

Despite the superior performance of deep learning in many applications, challenges remain in the area of regression on function spaces. In particular, neural networks are unable to encode function inputs compactly as each node encodes just a real value. We propose a novel idea to address this shortcoming: to encode an …

2018-04-13abs ↗pdf ↗

MO-PaDGAN improves multi-objective optimization by generating diverse and high-performing designs.

problem Challenges in parameterizing engineering designs for multi-objective optimization.
method MO-PaDGAN uses a generative adversarial network with a Determinantal Point Processes loss function to address these challenges.
result MO-PaDGAN generates designs with improved performance and coverage, even surpassing training data.

Deep neural networks have achieved impressive performance in many applications but their large number of parameters lead to significant computational and storage overheads. Several recent works attempt to mitigate these overheads by designing compact networks using pruning of connections. However, we observe that most …

2019-06-14abs ↗pdf ↗

SDRF estimates complex survey designs for conditional distributions.

problem Estimating conditional distributions under complex survey designs.
method Survey-calibrated distributional random forest (SDRF) with pseudo-population bootstrap and MMD split criterion.
result Established design consistency and model consistency for survey designs.

This paper provides a generic framework of component analysis (CA) methods introducing a new expression for scatter matrices and Gram matrices, called Generalized Pairwise Expression (GPE). This expression is quite compact but highly powerful: The framework includes not only (1) the standard CA methods but also (2) sev…

2012-07-16abs ↗pdf ↗

Liouville domains have become central objects in symplectic and contact geometry. However, the auxiliary data they involve --- namely, Liouville forms --- and the non-compactness of their completions generate some inconvenience. The notion of ideal Liouville domains is designed to suppress these awkward aspects and to …

2017-08-29abs ↗pdf ↗

We present a construction, called the limit of a tree system of spaces (or, less formally, a tree of spaces). The construction is designed to produce compact metric spaces that resemble fractals, out of more regular spaces, such as closed manifolds, compact polyhedra, compact Menger manifolds, etc. Such spaces are pote…

2013-04-18abs ↗pdf ↗

Algorithm identifies Pareto optimal designs efficiently for noisy, multi-objective functions.

problem Optimizing multi-objective functions with noisy data and large design spaces.
method Adaptive discretization and tree-based approach to identify Pareto optimal designs.
result Algorithm identifies Pareto optimal designs with fewer evaluations than exhaustive search.

This paper proposes BRIEF, a backward reduction algorithm that explores compact CNN-model designs from the information flow perspective. This algorithm can remove substantial non-zero weighting parameters (redundant neural channels) of a network by considering its dynamic behavior, which traditional model-compaction te…

2018-07-16abs ↗pdf ↗

This paper continues the study of a class of compact convex hypersurfaces in Euclidean space Rn+1, n1R^{n+1}, ~n \geq 1, which are boundaries of compact convex bodies obtained by taking the intersection of (solid) confocal paraboloids of revolution. Such hypersurfaces are called reflectors. In R3R^3 reflectors arise naturall…

2006-12-26abs ↗pdf ↗

Compact models for methane/air combustion reduce complexity without sacrificing accuracy.

problem Creating accurate, computationally efficient models for methane combustion.
method Data-oriented three-step methodology: 1) Remove non-essential species, 2) Numerically optimize to key species profiles, 3) Machine learning to refine parameters.
result Produced 19 and 15 species compact models that outperform current state-of-the-art models in accuracy and range of conditions.

Efficient algorithm converges to Nash equilibrium in bilinear problems with bandit feedback.

problem Learning dynamics in bilinear saddle-point problems with bandit feedback.
method Uncoupled learning algorithm combining experimental design and FTRL with a tailored regularizer.
result Last-iterate convergence rate of ildeO(T1/4) ilde{O}(T^{-1/4}) in high probability.

The paper extends consistency results for sequential design strategies to vector-valued Gaussian processes.

problem Estimating excursion sets of vector-valued Gaussian processes.
method Clarifying the connection between continuous Gaussian processes and Gaussian measures in Banach spaces, extending concepts and properties from scalar-valued settings to vector-valued settings.
result Consistency results for sequential design strategies can be applied to vector-valued Gaussian processes.

Paper uses relaxation techniques to find optimal brokerage fees with private signals.

problem Finding optimal brokerage fees for clients with private trading signals.
method Relaxation techniques to establish contract existence in asymmetric information settings.
result Existence of optimal brokerage fees established in a market model with private signals.

Compact models for NOX formation during methane combustion are created using a new algorithm.

problem Creating accurate models for NOX formation during complex combustion processes.
method Adapted Machine Learning Optimization of Chemical Kinetics (MLOCK) algorithm with Latin Square method for virtual reaction network generation.
result Compact models with high fidelity (>75%) in reproducing industry-defined performance targets are generated.

One of the greatest challenges in the design of a real-time perception system for autonomous driving vehicles and drones is the conflicting requirement of safety (high prediction accuracy) and efficiency. Traditional approaches use a single frame rate for the entire system. Motivated by the observation that the lack of…

2018-11-24abs ↗pdf ↗

This paper proposes a new evaluation metric and boosting method for weight separability in neural network design. In contrast to general visual recognition methods designed to encourage both intra-class compactness and inter-class separability of latent features, we focus on estimating linear independence of column vec…

2019-10-20abs ↗pdf ↗

Deep convolutional neural networks are known to specialize in distilling compact and robust prior from a large amount of data. We are interested in applying deep networks in the absence of training dataset. In this paper, we introduce deep audio prior (DAP) which leverages the structure of a network and the temporal in…

2019-12-21abs ↗pdf ↗

Machine learning finds a compact fixed point action for SU(3) gauge theory.

problem Finding accurate and compact parametrizations of fixed point actions for SU(3) gauge theory.
method Used machine learning, specifically a gauge equivariant convolutional neural network.
result Obtained a superior parametrization of a fixed point action for SU(3) gauge theory.

We introduce and develop fine shape, which has a very simple definition and aims to supersede all previously known shape theories for metrizable spaces. The problem with known shape theories of metrizable spaces is illustrated by the following bizarre situation. Čech cohomology is an invariant of shape, and a fortiori …

2018-08-30abs ↗pdf ↗

In many state-of-the-art compression systems, signal transformation is an integral part of the encoding and decoding process, where transforms provide compact representations for the signals of interest. This paper introduces a class of transforms called graph-based transforms (GBTs) for video compression, and proposes…

2019-09-03abs ↗pdf ↗

Torelli space (in genus g) is the moduli space of compact Riemann surfaces of genus g together with a symplectic basis of their first homology group. It is the quotient of the genus g Teichmuller space by the Torelli group T_g and is a model of the classifying space of T_g. It is known that almost all T_g are not finit…

2005-08-26abs ↗pdf ↗

Optimal DP mechanisms for vector queries are found to be staircase distributions.

problem Designing optimal additive mechanisms for vector-valued queries under differential privacy.
method Reduction to radially symmetric distributions and convex rearrangement theory.
result Staircase mechanisms are optimal for any norm and cost function.

Tensor neural network improves human pose classification from 3D skeleton data.

problem Efficiently processing spatiotemporal data for human pose classification.
method Proposes a tensor-based neural network with three components: spatiotemporal feature construction, tensor fusion, and tensor-based neural network processing.
result Achieves state-of-the-art performance in human pose classification.

In this work, we propose a new recurrent autoencoder architecture, termed Feedback Recurrent AutoEncoder (FRAE), for online compression of sequential data with temporal dependency. The recurrent structure of FRAE is designed to efficiently extract the redundancy along the time dimension and allows a compact discrete re…

2019-11-11abs ↗pdf ↗

The paper introduces Causal Neural Operators to approximate operators in stochastic analysis.

problem Leveraging temporal structure in non-linear operators for deep learning models.
method Designing a deep learning model framework for infinite-dimensional linear metric spaces.
result Causal Neural Operators can uniformly approximate Hölder or smooth trace class operators.

Gradient boosted decision trees are a popular machine learning technique, in part because of their ability to give good accuracy with small models. We describe two extensions to the standard tree boosting algorithm designed to increase this advantage. The first improvement extends the boosting formalism from scalar-val…

2017-10-31abs ↗pdf ↗

EPICSCORE improves conformal scores by explicitly accounting for epistemic uncertainty.

problem Overconfident predictions in data-sparse regions due to lack of epistemic uncertainty.
method Model-agnostic approach using Bayesian techniques like Gaussian Processes, Dropout, and Regression Trees.
result Enhanced predictive intervals that adaptively expand in sparse data regions and maintain compact intervals in abundant data.

Unsupervised segmentation learns features without labels, improving accuracy.

problem Discover and localize semantically meaningful categories in images without annotations.
method Separates feature learning from cluster compactification; distills unsupervised features into discrete semantic labels using a contrastive loss function.
result Significant improvement over prior state of the art on semantic segmentation challenges.