Quantization and reduction studied for CR manifolds with group actions.
problem Quantization and reduction for CR manifolds with group actions.
method Consider a compact torsion free CR manifold X with a G-equivariant rigid CR line bundle L. The high tensor powers of L are studied, and a weighted G-invariant Fourier-Szegő operator projects onto the space of G-invariant CR sections. result Quantization commutes with reduction for sufficiently high tensor powers of the line bundle.
A new method using energy distance for ensemble and scenario reduction.
problem Solving complex dynamic and stochastic programs, especially in energy systems.
method Proposes a new method based on energy distance for ensemble and scenario reduction.
result Reduced scenario sets exhibit better statistical properties for energy distance than Wasserstein distance.
MARS optimizes large model training by reducing variance, outperforming AdamW.
problem Training large models efficiently and scalably.
method Unified optimization framework MARS combining preconditioned gradient updates and variance reduction.
result MARS outperforms AdamW in training GPT-2 models.
Unified approach combines prediction-powered inference and variance reduction for semi-supervised optimization.
problem Scarcity of labeled data in semi-supervised optimization.
method PPI-SVRG, combining PPI and SVRG methods.
result Unified convergence bound with improved performance under label scarcity.
Graph neural network optimizes energy-efficient precoding for massive MIMO systems.
problem Energy bottleneck in massive MIMO systems due to high DAC complexity and power consumption.
method Proposes a graph neural network to directly output precoded quantized vectors from channel matrix and transmit symbols.
result Significant increase in achievable sum rate with reduced DAC power consumption.
PoWER-BERT speeds up BERT inference by eliminating redundant word-vectors.
problem Improving BERT inference speed without sacrificing accuracy.
method Eliminating redundant word-vectors using a self-attention-based significance measure and learning the number of vectors to eliminate.
result Up to 4.5x reduction in inference time with <1% loss in accuracy on GLUE benchmark.
Federated learning optimizes power for reliable V2V communication.
problem Minimizing power consumption for reliable V2V communication.
method Decentralized federated learning for estimating extreme queue lengths.
result Significant reduction in extreme events of queue lengths.
A framework uses a mixture of predictors for semi-supervised inference.
problem Limited labeled data, abundant unlabeled data.
method Mixture of Experts (MOE) for semi-supervised inference.
result MOE-powered inference framework achieves smallest possible variance.
Improved BER with reduced power in time-domain digital backpropagation.
problem Improving BER performance in time-domain digital backpropagation.
method Jointly optimized and quantized chromatic dispersion filters using machine learning.
result Improved BER performance and power dissipation reductions.
Paper proposes a novel R-JDRDL method for SPD manifolds.
problem High-dimensional noisy signals analysis.
method Riemannian optimization framework for joint DR and DL.
result R-JDRDL outperforms existing algorithms in image classification.
Balanced Neural ODEs combine VAEs and Neural ODEs for efficient time series modeling.
problem Efficiently modeling systems with time-varying inputs and varying complexity.
method Combines VAEs for dimensionality reduction and Neural ODEs for dynamics, using variational parameters to adaptively learn.
result Balanced Neural ODEs (B-NODE) efficiently approximate Koopman operator without predefined dimensionality.
This paper gives a connection between well chosen reductions of the Links-Gould invariants of oriented links and powers of the Alexander-Conway polynomial. We prove these formulas by showing the representations of the braid groups we derive the specialized Links-Gould polynomials from can be seen as exterior powers of …
Study finds cherry-picking load shaping strategies outperforms others in reducing grid CO2 emissions.
problem Lack of detailed counterfactual data makes it hard to assess load shaping strategies' effectiveness.
method Calibrated granular ERCOT simulations for counterfactual analysis of load shaping strategies.
result LMP-based load shaping outperforms other strategies in reducing grid CO2 emissions.
A new robust PCA estimator combining M-estimators and minimum divergence estimators.
problem Adverse effect of outlying observations in PCA for high-dimensional data.
method Minimum density power divergence estimator combined with a computationally efficient algorithm.
result High breakdown guarantee regardless of data dimension with theoretical support and practical applications.
The paper calculates Bachelier option prices using Taylor expansions and applies it as a variance reduction technique.
problem Calculating Bachelier option prices and variance reduction in correlated cases.
method Taylor expansions and classical Itô calculus to derive option prices, uses negative powers of future mean volatility.
result The paper provides a new method to calculate Bachelier option prices and applies it to reduce variance in Monte Carlo simulations.
Low redispatch prices boost green hydrogen production cost, encouraging electrolyzer siting.
problem Uncertainty in redispatch power availability and its impact on green hydrogen production cost.
method Historic redispatch time series analysis and power purchase scenarios evaluation.
result Low price levels can lead to notable production cost reductions, incentivizing electrolyzer siting.
New neural network method simplifies high-dimensional data.
problem Scalability issues in nonlinear sufficient dimension reduction.
method Stochastic neural network with adaptive gradient algorithm.
result Proposed method outperforms existing methods on large-scale data.
Introduces a reduction system for Artin-Tits groups, improving algorithms and proving periodicity results.
problem Computing reduction systems in Artin-Tits groups of spherical type.
method Introduces a canonical reduction system, proves periodicity of centralizers, and provides algorithms.
result Improved algorithms for computing reduction systems in braid groups and Artin-Tits groups.
ES optimization improved by structured control variates.
problem Improving accuracy of Evolution Strategies in RL.
method RL-specific variance reduction through structured control variates.
result Structured control variates outperform general variance reduction methods.
Paper improves tree probability estimation using stochastic optimization and variance reduction.
problem Improving tree probability estimation in phylogenetic inference.
method Introduces computationally efficient methods for training SBNs and variance reduction for optimization.
result Methods outperform previous baseline methods in tree topology probability estimation and Bayesian phylogenetic inference.
Reduces complexity of financial contagion dynamics on networks.
problem Complexity of financial contagion dynamics on networks.
method Dimensional reduction methods (degree-weighted and spectral reduction).
result Spectral reduction better handles heterogeneous networks.
Paper proposes quantizing RNNs to save space and power.
problem Over-parameterization in RNNs leads to inefficiency.
method Increases bit-width reduction for accuracy preservation.
result RNNs can maintain accuracy with reduced precision.
New algorithms reduce computational burden for principal support vector machines.
problem High computational cost of principal support vector machines for large datasets.
method Two distributed estimation algorithms for principal support vector machines.
result Statistical efficiency is maintained with distributed algorithms.
A wearable EEG headband detects primary colors from brain activity for color perception.
problem Detecting primary colors from brain activity for color perception.
method Spectral power features, statistical features, and correlation features from continuous Morlet wavelet transform; dimensionality reduction techniques like Forward Feature Selection and Stacked Autoencoders; Random Forest Classifier.
result Best overall accuracy of 80.6% for intra-subject classification.
A new method for kernel tests without data splitting increases power.
problem Lack of power in kernel-based tests due to data splitting.
method Selective inference framework to learn hyperparameters and test on full sample.
result Empirically larger test power without data splitting, regardless of split proportion.
Bayesian framework reduces high-dimensional GP modeling costs.
problem Challenges in fitting Gaussian processes to high-dimensional inputs.
method Hierarchical Bayesian model with orthonormal projection matrix, incorporating Deep Gaussian Processes.
result Improves predictive performance and uncertainty quantification.
New method uses machine learning to improve statistical inference.
problem Performing inference on conditional functionals with scarce labeled data.
method Combines localization with prediction-based variance reduction.
result Valid and sharp confidence intervals for conditional functionals.
Novel privatization framework for high-dimensional variable selection with differential privacy.
problem High-dimensional controlled variable selection with rigorous FDR control under differential privacy constraints.
method Gaussian Johnson-Lindenstrauss Transformation for privatizing the knockoff matrix.
result The proposed private variable selection procedure maintains statistical power even under strict privacy budgets.
The paper constructs a star product on a symplectically reduced phase space for a lattice gauge model.
problem Constructing a star product on a singular symplectically reduced phase space.
method Fedosov quantization, Levi-Civita connection, homological reduction.
result The symplectically reduced phase space of the lattice gauge model carries a star product.
SNRA combines power-efficient probabilistic and deterministic computing for deep belief networks.
problem Efficiently training and evaluating deep belief networks with low power consumption.
method Developed a spintronic neuromorphic reconfigurable array (SNRA) for in-circuit training and evaluation of deep belief networks (DBNs). Used probabilistic spin logic devices and a four-state finite state machine for unsupervised training.
result SNRA achieves more than 80% reduction in combined dynamic and static power dissipation compared to SRAM-based configurable fabrics.
Consider an action of a connected compact Lie group on a compact complex manifold M, and two equivariant vector bundles L and E on M, with L of rank 1. The purpose of this paper is to establish holomorphic Morse inequalities à la Demailly for the invariant part of the Dolbeault cohomology of tensor powers of …
This paper introduces a new unsupervised method for dimensionality reduction via regression (DRR). The algorithm belongs to the family of invertible transforms that generalize Principal Component Analysis (PCA) by using curvilinear instead of linear features. DRR identifies the nonlinear features through multivariate r…
Enhances option pricing for American-style options using JDOI method.
problem Pricing American-style options efficiently under stochastic volatility.
method Extends DOI variance reduction technique to Lévy dynamics, combining with LSMC.
result Strong variance reduction in option pricing compared to standard LSMC.
Supervised linear feature extraction can be achieved by fitting a reduced rank multivariate model. This paper studies rank penalized and rank constrained vector generalized linear models. From the perspective of thresholding rules, we build a framework for fitting singular value penalized models and use it for feature …
Paper presents a new method for multiclass classification using hyperplane arrangements.
problem Developing efficient multiclass classifiers.
method Mixed integer programming formulations with hyperplane arrangements, kernel trick adaptation, and dimensionality reductions.
result Our proposal outperforms other methods in multiclass classification tasks.
Meta-CVs leverage task similarity to reduce variance with limited data.
problem Reducing variance in Monte Carlo estimators with few samples.
method Meta-learning control variates for related tasks.
result Meta-CVs lead to significant variance reduction in settings with limited data.
The paper computes characteristic classes for Lie group representations.
problem Computing characteristic classes for Lie group representations.
method The paper outlines a procedure to compute characteristic classes of irreducible representations of Lie groups, expressing them as polynomial functions in the highest weight.
result The paper expresses characteristic classes of Lie group representations as polynomial functions in the highest weight.
FPG uses fractional calculus for efficient reinforcement learning with long-term memory.
problem High variance and inefficient sampling in standard policy gradient methods for long-term temporal modeling.
method Fractional Policy Gradients (FPG) incorporating Caputo fractional derivatives for power-law temporal correlations.
result Achieves asymptotic variance reduction of order O(t^(-alpha)) and sample efficiency gains.
WeldNet reduces complex dynamics to simpler, manageable segments.
problem Complex, high-dimensional time-dependent datasets from physical processes are costly to simulate.
method Windowed Encoders for Learning Dynamics, splitting time domain into windows for nonlinear dimension reduction and propagator training.
result WeldNet captures nonlinear latent structures and dynamics, outperforming existing methods.
SRP efficiently learns class-aware embeddings for large datasets.
problem High computational complexity in supervised dimensionality reduction for large datasets.
method Supervised random projections (SRP) for direct class-aware embedding learning.
result SRP achieves 1-2 orders of magnitude better computational performance.
New method ranks power grid contingencies for faster security assessment.
problem Maintain high voltage power transmission networks in security.
method Neural network-based ranking of higher order contingencies.
result Residual risk of contingencies decreases dramatically compared to considering only N-1 cases.
New principle reduces load imbalance in LLM serving systems, saving up to 52% energy.
problem Wasted computational power due to load imbalance in LLM serving systems.
method Developed a universal load-balancing principle for barrier-synchronized systems with non-migratable state.
result Proves worst-case theoretical guarantees for imbalance reduction and energy savings.
HashReward improves imitation learning in high-dimensional environments by balancing reward generation and dimensionality reduction.
problem Making policies generalize well in high-dimensional state-action spaces, especially in game playing with raw pixel inputs.
method HashReward uses supervised hashing to balance reward generation and dimensionality reduction.
result HashReward outperforms state-of-the-art methods in high-dimensional environments.
We present a theoretical analysis and empirical evaluations of a novel set of techniques for computational cost reduction of classifiers that are based on learned transform and soft-threshold. By modifying optimization procedures for dictionary and classifier training, as well as the resulting dictionary entries, our t…
Random projections enhance neural networks by reducing dimensions and speeding up training.
problem Training and expressive power of neural networks with high-dimensional inputs.
method Random projections to embed sparse vectors or low-dimensional manifolds into a smaller space, reducing the number of parameters and speeding up training.
result The number of neurons required for approximating a function depends on sparsity or manifold dimension, not the input vector dimension.
The grid integration of intermittent Renewable Energy Sources (RES) causes costs for grid operators due to forecast uncertainty and the resulting production schedule mismatches. These so-called profile service costs are marginal cost components and can be understood as an insurance fee against RES production schedule u…
A new geometry-preserving method for interpreting compositional data.
problem Statistical challenges in high-dimensional compositional data.
method Geometry-preserving framework for dimension reduction of compositional data.
result Identification of a central compositional subspace for compositional predictors.
FSIR extends SIR for federated learning with privacy and efficiency.
problem Privacy-preserving dimension reduction in federated learning.
method FSIR employs sliced inverse regression with differential privacy and collaborative variable screening.
result FSIR achieves effective dimension reduction and privacy protection in federated learning.