Paper introduces SCP to measure classifier distortion and optimized coding strategies.
problem Noise impacts binary classifier performance; goal is to minimize distortion.
method Developed a low-complexity estimate of SCP using quantization and polynomial multiplication. Also studied replication error-correcting codes for maximizing SCP.
result Introduced optimized coding strategies that specifically aim to maximize classification probability (minimizing distortion) for the same redundancy overhead.
Numerous methods for computing conformal mesh paramterizations has been developed due to the vast applications in the field of geometry processing. Spectral conformal parameterization (SCP) is one of these methods to computing a quality conformal parameterization based on the spectral technique. SCP focus on a generali…
In this paper we study a broad class of structured nonlinear programming (SNLP) problems. In particular, we first establish the first-order optimality conditions for them. Then we propose sequential convex programming (SCP) methods for solving them in which each iteration is obtained by solving a convex programming pro…
Simplified image clustering achieves competitive results without text-based embeddings.
problem Complexity and resource requirements of state-of-the-art clustering methods.
method SCP: trains a small cluster head using pre-trained vision model features and positive data pairs.
result SCP achieves highly competitive performance on various benchmark datasets.
BCI provides calibrated prediction intervals for time series forecasts.
problem Calibration of prediction intervals for time series forecasts.
method BCI wraps around any time series forecasting models and optimizes interval lengths using dynamic programming.
result BCI achieves long-term coverage under arbitrary distribution shifts and temporal dependence.
The study improves prediction regions for hierarchical data using a projection step.
problem Improving prediction regions for hierarchical multivariate data.
method Integrating a projection step in the split conformal prediction (SCP) procedure to reduce prediction regions.
result The resulting prediction regions are globally smaller under both joint and component-wise coverage objectives.
New method solves complex constrained optimization problems.
problem Constrained nonconvex-nonconcave minimax optimization problems.
method Inexact proximal gradient method using sequential convex programming.
result Established complexity guarantees for approximate stationary points.
This paper integrates LLMs into SCD to improve causal inference accuracy.
problem Challenges in acquiring domain expert knowledge for causal models.
method Statistical causal prompting (SCP) for LLMs and prior knowledge augmentation for SCD.
result LLM-KBCI and SCD augmented with LLM-KBCI approach ground truths more closely.
Study how actions affect perception in embodied agents using group theory.
problem Understanding how actions influence perception in autonomous agents.
method Mathematical formalism of group theory applied to sensory commutativity of action sequences.
result Introduced Sensory Commutativity Probability (SCP) to measure action effects on perception.
Extends PoS proof-of-stake transaction fee mechanism with miner utility model.
problem Designing a transaction fee mechanism for PoS protocol that incorporates miner utility.
method Introduced a new mechanism (BSP(θ)) incorporating a parameter θ to ensure user and miner incentives.
result The new mechanism (BSP(θ)) satisfies user and miner incentives and contract proofness.
Novel method extracts hierarchical brain connectivity patterns from fMRI.
problem Functional hierarchical organization of the human brain.
method Sparse Connectivity Patterns (SCPs) with hierarchy of sparse overlapping patterns, deep factorization of correlation matrices.
result Reproducible multi-scale hierarchical SCPs more stable than single-scale patterns.
NSC classifies hybrid system states for time-bounded reachability, achieving high accuracy with minimal false negatives.
problem Classifying states in hybrid systems for time-bounded reachability.
method Neural State Classification using Deep Neural Networks.
result Achieved 99.25% to 99.98% accuracy with false-negative rates reduced to 0.0015 to 0 after tuning.
Ensemble methods have been shown to be an effective tool for solving multi-label classification tasks. In the RAndom k-labELsets (RAKEL) algorithm, each member of the ensemble is associated with a small randomly-selected subset of k labels. Then, a single label classifier is trained according to each combination of ele…
PCONV combines fine-grained and coarse-grained pruning for efficient DNN inference on mobile devices.
problem Achieving high sparsity and accuracy in DNN weight pruning for real-time mobile execution.
method PCONV introduces a new sparsity dimension by combining fine-grained pruning patterns inside coarse-grained structures.
result PCONV outperforms state-of-the-art frameworks in speed and efficiency without accuracy loss.
This paper studies the optimal consumption under the addictive habit formation preference in markets with transaction costs and unbounded random endowments. To model the proportional transaction costs, we adopt the Kabanov's multi-asset framework with a cash account. At the terminal time T, the investor can receive unb…
Paper introduces CRP-O framework for uncertainty quantification in deep operators.
problem Uncertainty quantification in energy-efficient deep learning algorithms, especially in SNNs.
method CRP-O framework using RP networks and SCP, with Gaussian Process Regression for super-resolution.
result Enhanced uncertainty bounds improve UQ estimates compared to existing methods.
SOCP uses SOM to find groups and local calibration buffers for better regional coverage.
problem Heterogeneous regional coverage gaps in conformal prediction.
method Self-Organizing Map (SOM) for group discovery; local calibration buffers at BMU or fixed grid.
result Reduces regional coverage gaps on 7/8 benchmarks by 7.1%.
Framework learns structural and functional brain network embeddings while preserving their properties.
problem Joint learning of structural and functional brain networks while preserving their intrinsic properties.
method Siamese community-preserving graph convolutional network (SCP-GCN) that learns from both structural and functional connectivity.
result Superior performance in neurological disorder analysis compared to existing methods.