Paper uses ML to predict insulator flashover risk.
problem Predicting flashover risk of aging insulators.
method Supervised ML with XGBoost, using LC and voltage features.
result Model accurately estimates insulator flashover probability.
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,695 papers · 148 categories
Trend · papers per month
48 results for “Overhead Line Insulators”
Generically, topological insulators have conical points leading to Dirac-like currents.
problem Understanding the conical structure of degeneracies in topological phases of matter.
method Analyzing Hermitian matrices with three parameters to show conical points.
result Adiabatic deformations of topological insulators result in Dirac-like currents whose total conductivity equals the chiral number of conical points.
Gerbes encode spectral gaps in topological insulators.
problem Capturing spectral gaps in topological insulators.
method Geometric encoding through 'Real' gerbes.
result Gerbes precisely capture spectral gaps.
Recently we introduced T-duality in the study of topological insulators. In this paper, we study the bulk-boundary correspondence for three phenomena in condensed matter physics, namely, the quantum Hall effect, the Chern insulator, and time reversal invariant topological insulators. In all of these cases, we show that…
Machine learning for many-body physics: efficient solution of dynamical mean-field theorycond-mat.str-el
Machine learning methods for solving the equations of dynamical mean-field theory are developed. The method is demonstrated on the three dimensional Hubbard model. The key technical issues are defining a mapping of an input function to an output function, and distinguishing metallic from insulating solutions. Both meta…
Quantum phase diagrams for Chern topological insulators show jumps at critical loci.
problem Understanding phase transitions in Chern topological insulators.
method Mathematical formulation and explicit families of physical systems.
result Synthetic design of arbitrary Chern jumps in topological phases.
Recently we introduced T-duality in the study of topological insulators, and used it to show that T-duality trivialises the bulk-boundary correspondence in 2 dimensions. In this paper, we partially generalise these results to higher dimensions and briefly discuss the 4D quantum Hall effect.
Conductor galloping is the high-amplitude, low-frequency oscillation of overhead power lines due to wind. Such movements may lead to severe damages to transmission lines, and hence pose significant risks to the power system operation. In this paper, we target to design a prediction framework for conductor galloping. Th…
Study of spectral flow in symmetric Toeplitz operator families.
problem Understanding spectral flow in families of symmetric Toeplitz operators.
method Analog of Atiyah-Singer-Robbin-Salamon theorem for -valued spectral flow.
result Graded secondary spectral flow equals secondary index of a Callias-type operator.
We present homotopy theoretic and geometric interpretations of the Kane-Mele invariant for gapped fermionic quantum systems in three dimensions with time-reversal symmetry. We show that the invariant is related to a certain 4-equivalence which lends it an interpretation as an obstruction to a block decomposition of the…
Ensuring differential privacy of models learned from sensitive user data is an important goal that has been studied extensively in recent years. It is now known that for some basic learning problems, especially those involving high-dimensional data, producing an accurate private model requires much more data than learn…
We propose a novel data-dependent structured gradient regularizer to increase the robustness of neural networks vis-a-vis adversarial perturbations. Our regularizer can be derived as a controlled approximation from first principles, leveraging the fundamental link between training with noise and regularization. It adds…
SOTERIA optimizes neural networks for secure inference with minimal overhead.
problem Protecting user privacy in ML-as-a-service models with low overhead.
method Neural architecture search with dual objectives of accuracy and cryptographic efficiency.
result SOTERIA constructs efficient models for secure inference.
Paper introduces FoMoH for optimization without backpropagation.
problem Optimizing machine learning models without backpropagation.
method Second-order hyperplane search, forward-mode stochastic gradient method, hyper-dual numbers, FoMoH.
result Developed a novel optimization algorithm that avoids backpropagation.
Training modern deep learning models requires large amounts of computation, often provided by GPUs. Scaling computation from one GPU to many can enable much faster training and research progress but entails two complications. First, the training library must support inter-GPU communication. Depending on the particular …
The subtle interplay between local and global charges for topological semimetals exactly parallels that for singular vector fields. Part of this story is the relationship between cohomological semimetal invariants, Euler structures, and ambiguities in the torsion of manifolds. Dually, a topological semimetal can be rep…
FedLog reduces communication in federated learning by sharing data summaries.
problem Significant communication overhead in federated learning with large model parameters.
method Shares minimal sufficient statistics via Bayesian inference and differential privacy.
result High learning accuracy with low communication overhead.
The Atiyah-Patodi-Singer index theorem describes the bulk-edge correspondence of symmetry protected topological insulators. The mathematical setup for this theorem is, however, not directly related to the physical fermion system, as it imposes on the fermion fields a non-local and unnatural boundary condition known as …
A basic question in the theory of fault-tolerant quantum computation is to understand the fundamental resource costs for performing a universal logical set of gates on encoded qubits to arbitrary accuracy. Here we consider qubits encoded with constant space overhead (i.e. finite encoding rate) in the limit of arbitrari…
Deep learning reduces training overhead in massive MIMO systems.
problem Reducing training overhead in massive MIMO systems.
method Use of deep learning (NNs) to improve CSI acquisition and feedback processes.
result Significant improvements in performance and reduced complexity.
We consider the problem of learning a binary classifier from different data sources, among which at most an fraction are adversarial. The overhead is defined as the ratio between the sample complexity of learning in this setting and that of learning the same hypothesis class on a single data distribution. We pr…
We show that the (graded) spectral flow of a family of Toeplitz operators on a complete Riemannian manifold is equal to the index of a certain Callias-type operator. When the dimension of the manifold is even this leads to a cohomological formula for the spectral flow. As an application, we compute the spectral flow of…
We study the collaborative PAC learning problem recently proposed in Blum et al.~\cite{BHPQ17}, in which we have players and they want to learn a target function collaboratively, such that the learned function approximates the target function well on all players' distributions simultaneously. The quality of the col…
New unsupervised method selects hard negative samples for contrastive learning.
problem How to select good negative examples for contrastive learning without using true similarity information.
method Developed a new family of unsupervised sampling methods for hard negative selection.
result Improves downstream performance across multiple modalities.
SRG improves optimization efficiency with reduced memory and computation overhead.
problem Limited applicability of variance-reduced optimization algorithms.
method SRG (stochastic reweighted gradient) using importance sampling.
result SRG outperforms SGD and provably improves convergence in strongly-convex cases.
Ultra-cold atomic gases are unique in terms of the degree of controllability, both for internal and external degrees of freedom. This makes it possible to use them for the study of complex quantum many-body phenomena. However in many scenarios, the prerequisite condition of faithfully preparing a desired quantum state …
Federated LIDAR aided beam selection reduces mmWave beam search overhead.
problem Efficient link configuration in mmWave communication systems with reduced beam search overhead.
method Federated learning of LIDAR data to train a shared neural network for beam selection.
result Proposed method significantly outperforms previous works in performance and complexity.
Local AdaAlter: Communication-Efficient Stochastic Gradient Descent with Adaptive Learning Ratescs.LG
When scaling distributed training, the communication overhead is often the bottleneck. In this paper, we propose a novel SGD variant with reduced communication and adaptive learning rates. We prove the convergence of the proposed algorithm for smooth but non-convex problems. Empirical results show that the proposed alg…
Two main obstacles preventing the widespread adoption of variational Bayesian neural networks are the high parameter overhead that makes them infeasible on large networks, and the difficulty of implementation, which can be thought of as "programming overhead." MC dropout [Gal and Ghahramani, 2016] is popular because it…
Randomized matrix compression techniques, such as the Johnson-Lindenstrauss transform, have emerged as an effective and practical way for solving large-scale problems efficiently. With a focus on computational efficiency, however, forsaking solutions quality and accuracy becomes the trade-off. In this paper, we investi…
The computation of convolution layers in deep neural networks typically rely on high performance routines that trade space for time by using additional memory (either for packing purposes or required as part of the algorithm) to improve performance. The problems with such an approach are two-fold. First, these routines…
The randomized-feature approach has been successfully employed in large-scale kernel approximation and supervised learning. The distribution from which the random features are drawn impacts the number of features required to efficiently perform a learning task. Recently, it has been shown that employing data-dependent …
Turbo-Aggregate reduces secure aggregation time from quadratic to nearly linear.
problem Quadratic overhead in secure model aggregation for federated learning.
method Multi-group circular strategy, additive secret sharing, and coding techniques.
result Achieves overhead, compared to , for up to 50% user dropout.
Robotic vision is a field where continual learning can play a significant role. An embodied agent operating in a complex environment subject to frequent and unpredictable changes is required to learn and adapt continuously. In the context of object recognition, for example, a robot should be able to learn (without forg…
Wartime Controls, Political Connections, and the Pricing of Zaibatsu Rents in Japan, 1930-1943econ.GN
The study analyzes how wartime controls influenced zaibatsu stock prices in Japan.
problem How wartime economic controls affected zaibatsu stock prices in Japan.
method Developed a four-portfolio asset-pricing model and used a CAPM-AR(p)-SV event-study framework.
result Wartime economic controls influenced stock prices through financing wedges and zaibatsu affiliation.
Efficient FPGA virtualization for deep learning reduces user isolation and overhead.
problem Poor isolation and heavy re-compilation overhead in FPGA-based DNN accelerators.
method Two-level instruction dispatch module, multi-core hardware resources pool, tiling-based instruction frame package, two-stage static-dynamic compilation.
result 1.07-1.69x and 1.88-3.12x throughput improvement over previous designs.
Paper proposes ADC framework to reduce ViT SL training communication overhead.
problem Reducing communication overhead in ViT SL training.
method Two parallel compression strategies: class-agnostic merging and token discarding.
result Significantly reduces communication overhead without sacrificing accuracy.
ISAAC Newton uses input-based curvature for efficient training.
problem Efficient training in small-batch stochastic regimes.
method ISAAC Newton conditions gradients using selected second-order information based on input.
result Effective training even in small-batch stochastic regimes, competitive to first-order and second-order methods.
HCBM improves deep learning explainability by non-linear concept aggregation.
problem Lack of explainable and accurate predictions in deep learning for high-stake decisions.
method Introduce Hoeffding Concept Bottleneck Models (HCBM) using Hoeffding functional decomposition of gradient-boosted trees for non-linear and sparse concept aggregation.
result HCBM outperforms standard linear CBM and is robust to interconcept leakage.
Generative Adapter adapts LMs with a single forward pass, reducing inference overhead.
problem Efficient adaptation of large language models for new contexts.
method Generative Adapter directly maps new contexts to low-rank LM adapters via self-supervised learning.
result Significant reduction in inference overhead with no need for fine-tuning.
TorchGAN is a PyTorch based framework for writing succinct and comprehensible code for training and evaluation of Generative Adversarial Networks. The framework's modular design allows effortless customization of the model architecture, loss functions, training paradigms, and evaluation metrics. The key features of Tor…
Information-theoretic Bayesian optimisation techniques have demonstrated state-of-the-art performance in tackling important global optimisation problems. However, current information-theoretic approaches require many approximations in implementation, introduce often-prohibitive computational overhead and limit the choi…
Certified training improves robustness against adversarial attacks.
problem Certified training's gap with empirical robustness limits its practical utility.
method Combining adversarial attacks with network over-approximations.
result Certified training can prevent catastrophic overfitting and bridge the gap to multi-step baselines.
Common privacy enhancing technologies fail to effectively hide certain statistical aspects of encrypted traffic, namely individual packets length, packets direction and, packets timing. Recent researches have shown that using such attributes, an adversary is able to extract various information from the encrypted traffi…
Adaptive gradient-based optimizers such as Adagrad and Adam are crucial for achieving state-of-the-art performance in machine translation and language modeling. However, these methods maintain second-order statistics for each parameter, thus introducing significant memory overheads that restrict the size of the model b…
Paper introduces a new adaptive gradient method with gradient compression for distributed training.
problem Communication overhead in distributed machine learning systems.
method Adaptive gradient method with gradient compression, scalable system BytePS-Compress.
result Convergence rate of for non-convex problems.
Low-precision training reduces computational cost and produces efficient models. Recent research in developing new low-precision training algorithms often relies on simulation to empirically evaluate the statistical effects of quantization while avoiding the substantial overhead of building specific hardware. To suppor…
A major obstacle for widespread deployment of frequency division duplex (FDD)-based Massive multiple-input multiple-output (MIMO) communications is the large signaling overhead for reporting full downlink (DL) channel state information (CSI) back to the basestation (BS), in order to enable closed-loop precoding. We com…